Optimal Hardness of Online Algorithms for Large Independent Sets
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866917235717570560 |
|---|---|
| author | Gamarnik, David Kızıldağ, Eren C. Warnke, Lutz |
| author_facet | Gamarnik, David Kızıldağ, Eren C. Warnke, Lutz |
| contents | We study the algorithmic problem of finding a large independent set in the Erd{ö}s-Rényi random graph $G(n,p)$. For constant $p$ and $b=1/(1-p)$, the largest independent set has size $2\log_b n$, while a simple greedy algorithm - revealing vertices sequentially and making decisions based only on previously seen vertices - finds an independent set of size $\log_b n$. In his seminal 1976 paper, Karp challenged to either improve this guarantee or establish its hardness. Decades later, this problem remains open - one of the most prominent algorithmic problems in the theory of random graphs.
In this paper, we establish that a broad class of online algorithms fails to find an independent set of size $(1+ε)\log_b n$ whp. This class includes Karp's algorithm as a special case, and extends it by allowing the algorithm to query exceptional edges, not yet "seen" by the algorithm. Our lower bound holds for $p\in [d/n,1-n^{-1/d}]$. In the dense regime (constant $p$), we also prove that our result is asymptotically tight with respect to the number of exceptional edges queried, by designing an online algorithm which beats the half-optimality threshold when the number of exceptional edges slightly exceeds our bound.
Our result provides evidence for the algorithmic hardness of Karp's problem, by supporting the conjectured optimality of the greedy algorithm and establishing it within the class of online algorithms. Our proof relies on a refined analysis of the geometric structure of large independent sets, establishing a variant of the Overlap Gap Property (OGP). While OGP has predominantly served as a barrier to stable algorithms, online algorithms are inherently unstable, necessitating new ideas. Our proof refines the OGP framework by incorporating several new ideas (including temporal interpolation paths and stopping-times) that we expect to be useful for other online models. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_11450 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Optimal Hardness of Online Algorithms for Large Independent Sets Gamarnik, David Kızıldağ, Eren C. Warnke, Lutz Data Structures and Algorithms Computational Complexity Discrete Mathematics Combinatorics Probability 68Q87, 60C05, 05C80, 68Q25, 68R10, 68W27 We study the algorithmic problem of finding a large independent set in the Erd{ö}s-Rényi random graph $G(n,p)$. For constant $p$ and $b=1/(1-p)$, the largest independent set has size $2\log_b n$, while a simple greedy algorithm - revealing vertices sequentially and making decisions based only on previously seen vertices - finds an independent set of size $\log_b n$. In his seminal 1976 paper, Karp challenged to either improve this guarantee or establish its hardness. Decades later, this problem remains open - one of the most prominent algorithmic problems in the theory of random graphs. In this paper, we establish that a broad class of online algorithms fails to find an independent set of size $(1+ε)\log_b n$ whp. This class includes Karp's algorithm as a special case, and extends it by allowing the algorithm to query exceptional edges, not yet "seen" by the algorithm. Our lower bound holds for $p\in [d/n,1-n^{-1/d}]$. In the dense regime (constant $p$), we also prove that our result is asymptotically tight with respect to the number of exceptional edges queried, by designing an online algorithm which beats the half-optimality threshold when the number of exceptional edges slightly exceeds our bound. Our result provides evidence for the algorithmic hardness of Karp's problem, by supporting the conjectured optimality of the greedy algorithm and establishing it within the class of online algorithms. Our proof relies on a refined analysis of the geometric structure of large independent sets, establishing a variant of the Overlap Gap Property (OGP). While OGP has predominantly served as a barrier to stable algorithms, online algorithms are inherently unstable, necessitating new ideas. Our proof refines the OGP framework by incorporating several new ideas (including temporal interpolation paths and stopping-times) that we expect to be useful for other online models. |
| title | Optimal Hardness of Online Algorithms for Large Independent Sets |
| topic | Data Structures and Algorithms Computational Complexity Discrete Mathematics Combinatorics Probability 68Q87, 60C05, 05C80, 68Q25, 68R10, 68W27 |
| url | https://arxiv.org/abs/2504.11450 |