cs.DS · 2026-10-28 · No. 156

Data Structures and Algorithms, 2026-10-28.

1 new papers in cs.DS. Titles, authors, abstracts. Links to arXiv. Want this in your inbox every morning? Subscribe →

01 — The papers

1 entries
  1. 01

    Online Interval Selection with Binary Predictions: Optimal Consistency and a Continuous Robustness Tradeoff

    Zhong Han

    cs.DS · cs.LG

    We study online interval selection with binary predictions of membership in a final optimal solution. Requests arrive in arbitrary order; accepted requests may be revoked, but rejected or revoked requests cannot be recovered. With rewards proportional to interval length, the best consistency under finite strict robustness is $d=(3+\sqrt5)/2$ when both guarantees hold almost surely on each fixed input, including for randomized algorithms. A...

    arxiv.org/abs/2610.37361 · PDF

This edition is part of The Daily Abstract — cs.DS archive. Subscribe to receive these in your inbox each morning, automatically translated to Spanish, with reply-to-PDF: arxivdaily.ignorelist.com.

Colophon Set in Georgia, with system sans for interface chrome and a monospaced stack for code and paper identifiers. Sole accent: amber #D99C5E. Built and served on an always-free VM. The masthead is set 14% letterspaced because newspapers do that and it works.