Metraipolis › archive › dc_dfc80fd76d26
Deterministic Streaming Lower Bounds for Approximate Maximum Clique and Maximum Independent Set — arXiv:2609.18635
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.18635
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-15T17:09:19.872Z
- SHA-256 of the archived text
7a2c051d61ac7e49cb00860b9422696012669207988b14b80bedac1c19ae3476- Stable URL of this page
https://metraipolis.com/documento/dc_dfc80fd76d26
How to cite
Deterministic Streaming Lower Bounds for Approximate Maximum Clique and Maximum Independent Set — arXiv:2609.18635 — arXiv (en), https://arxiv.org/abs/2609.18635 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_dfc80fd76d26 (Metraipolis archive dc_dfc80fd76d26, sha256 7a2c051d61ac7e49cb00860b9422696012669207988b14b80bedac1c19ae3476)
BibTeX
@misc{dcdfc80fd76d26,
title = {Deterministic Streaming Lower Bounds for Approximate Maximum Clique and Maximum Independent Set — arXiv:2609.18635},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.18635},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_dfc80fd76d26; sha256 7a2c051d61ac7e49cb00860b9422696012669207988b14b80bedac1c19ae3476},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.18635. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We study the canonical \textsf{Maximum Clique} and \textsf{Maximum Independent Set} problems in the one-pass edge-arrival graph streaming setting. Here, the edges of some input graph $G = (V,E)$ are presented one at a time (possibly including deletions), before an algorithm needs to produce either a large clique or independent set at the end of the stream, with the focus being on space complexity. We are interested in finding $\beta$-approximate solutions, for any $\beta \geq 1$. Previous work gave an algorithm using $\tilde{O}\left(n^2/\beta^2\right)$ bits of space, together with a corresponding $\tilde{\Omega}\left(n^2/\beta^2\right)$ two-party communication lower bound [Halldórsson et al., ICALP'12], seeming to resolve the problem. However, their algorithm crucially relies on randomness, and the best known deterministic algorithm remains a folklore derandomisation using $O\left(n^2/\beta\right)$ bits of space, leaving a (deterministic) gap of size $\tilde{O}(\beta)$. We resolve this deterministic gap with an (almost) tight lower bound: any deterministic algorithm for either problem must use $\Omega\left(\frac{n^2}{\beta\cdot\log n}\right)$ bits of space. Our proof is via a two-party one-way communication lower bound, and highlights the power of randomness when approaching either of these problems.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-17 in cs.DS).
Categorie arXiv: Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2609.18635 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-15T16:17:15.264Z dalla pagina https://arxiv.org/catchup/cs.DS/2026-09-17?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).