cs.DS · 2026-06-18 · No. 27

Data Structures and Algorithms, 2026-06-18.

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

01 — The papers

2 entries
  1. 01

    Learning Augmented Exact Exponential Algorithms

    Tatiana Belova, Yuriy Dementiev, Danil Sagunov

    cs.DS · cs.LG

    The field of learning-augmented algorithms has demonstrated that machine-learned predictions can bypass worst-case lower bounds across a wide range of problems. So far, however, the focus has been almost exclusively on polynomial-time algorithms, where predictions improve competitive ratios, approximation guarantees, or running times. In this paper, we raise the question of whether predictions can push the frontier of exact exponential-time...

    arxiv.org/abs/2606.18807 · PDF

  2. 02

    Fair Online Resource Allocation

    Christopher En, Yuri Faenza, Andrea Lodi, Gonzalo Muñoz

    cs.DS · cs.GT · cs.LG · math.OC

    We study the problem of fair online resource allocation, motivated by applications such as refugee resettlement and airline scheduling, where agents arrive sequentially and must be assigned to facilities with limited capacities. We introduce a model that maximizes the overall welfare subject to resource constraints and a Lipschitz fairness requirement, which ensures that similar agents arriving in the same batch receive similar expected...

    arxiv.org/abs/2606.18679 · 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.