Metraipolis › archive › dc_7bce22bd2c2b

A Tight Bound on Online Vertex Cover under Edge Arrivals — arXiv:2608.04994

Source: arXiv (en)
Original: https://arxiv.org/abs/2608.04994
License (as archived): CC0-1.0
Archived: 2026-10-31T11:58:22.227Z
SHA-256 of the archived text: 601be0df193c9ce3a627f700c2763e5d227fe029d98ef175d63b4cfc5f163a53
Stable URL of this page: https://metraipolis.com/documento/dc_7bce22bd2c2b

How to cite

A Tight Bound on Online Vertex Cover under Edge Arrivals — arXiv:2608.04994 — arXiv (en), https://arxiv.org/abs/2608.04994 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7bce22bd2c2b (Metraipolis archive dc_7bce22bd2c2b, sha256 601be0df193c9ce3a627f700c2763e5d227fe029d98ef175d63b4cfc5f163a53)

BibTeX

@misc{dc7bce22bd2c2b,
  title = {A Tight Bound on Online Vertex Cover under Edge Arrivals — arXiv:2608.04994},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.04994},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7bce22bd2c2b; sha256 601be0df193c9ce3a627f700c2763e5d227fe029d98ef175d63b4cfc5f163a53},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.04994. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We prove a tight impossibility result for online vertex cover under edge arrivals. No randomized integral or fractional algorithm achieves a competitive ratio strictly below $2$ against an oblivious adversary, even on bipartite graphs. Since the standard algorithm that takes both endpoints of every uncovered edge is $2$-competitive, this settles the optimal ratio. Our proof is a direct reduction from the recent breakthrough blueprint framework of Assadi, Jiang, and Xiang.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-06 in cs.DS).
Categorie arXiv: Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2608.04994 — 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-31T11:47:39.824Z dalla pagina https://arxiv.org/catchup/cs.DS/2026-08-06?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).