LAST but not Least: Online Spanners for Buy-at-Bulk
From MaRDI portal
Publication:4575775
DOI10.1137/1.9781611974782.38zbMath1410.68298arXiv1611.00052OpenAlexW2951117786MaRDI QIDQ4575775
Anupam Gupta, Kunal Talwar, R. Ravi, Seeun William Umboh
Publication date: 16 July 2018
Published in: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1611.00052
Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Online algorithms; streaming algorithms (68W27)
Related Items (4)
Group parking permit problems ⋮ Timing matters: online dynamics in broadcast games ⋮ Online Spanners in Metric Spaces ⋮ Bounded-degree light approximate shortest-path trees in doubling metrics
This page was built for publication: LAST but not Least: Online Spanners for Buy-at-Bulk
