Metraipolis › archive › dc_6eaa75301e82

Online Interval Selection on a Simple Chain — arXiv:2608.10376

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.10376
License (as archived)
CC0-1.0
Archived
2026-10-19T06:27:32.683Z
SHA-256 of the archived text
7e07c0cbe93ebedcbebf7f3bcda1d811087987890a8329b70761c3a869dce24b
Stable URL of this page
https://metraipolis.com/documento/dc_6eaa75301e82

How to cite

Online Interval Selection on a Simple Chain — arXiv:2608.10376 — arXiv (en), https://arxiv.org/abs/2608.10376 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_6eaa75301e82 (Metraipolis archive dc_6eaa75301e82, sha256 7e07c0cbe93ebedcbebf7f3bcda1d811087987890a8329b70761c3a869dce24b)
BibTeX
@misc{dc6eaa75301e82,
  title = {Online Interval Selection on a Simple Chain — arXiv:2608.10376},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.10376},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_6eaa75301e82; sha256 7e07c0cbe93ebedcbebf7f3bcda1d811087987890a8329b70761c3a869dce24b},
  year = {2026}
}

Archived text

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

A set of intervals $I = \{ I_1, I_2, \dots, I_n \}$ forms a simple chain if, for every $2\leq i \leq n-1$, interval $I_i$ overlaps only with $I_{i-1}$ and $I_{i+1}$. We show that a deterministic memoryless one-directional revoking algorithm achieves a competitive ratio of $2(1 - 1/\sqrt{e}) \approx 0.786$ on the simple chain in the random order model, hence performs worse than the basic greedy algorithm without revoking that has a competitive ratio of $(1 - 1/e^2) \approx 0.864$, but better than any deterministic revoking algorithm in the adversarial model that has a competitive ratio of at most $0.75$. The proof of the latter also leads to a lower bound of $n/4$ for the advice complexity.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-12 in math.CO).
Categorie arXiv: Data Structures and Algorithms (cs.DS) ; Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2608.10376 — 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-19T06:20:30.699Z dalla pagina https://arxiv.org/catchup/math.CO/2026-08-12?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).