The power of deferral

DOI10.1145/2488608.2488674zbMath1293.05041OpenAlexW2071608792MaRDI QIDQ5495823

Anupam Gupta, Albert Gu, Amit Kumar

Publication date: 7 August 2014

Published in: Proceedings of the forty-fifth annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2488608.2488674

zbMATH Keywords

online algorithmsSteiner treegreedyprimal-dualrecourse

Mathematics Subject Classification ID

Trees (05C05) Online algorithms; streaming algorithms (68W27)

Related Items (8)

Simultaneously load balancing for every p-norm, with reassignments ⋮ The Power of Deferral: Maintaining a Constant-Competitive Steiner Tree Online ⋮ Serve or skip: the power of rejection in online bottleneck matching ⋮ A Local-Search Algorithm for Steiner Forest ⋮ Online constrained forest and prize-collecting network design ⋮ Unnamed Item ⋮ The Power of Recourse for Online MST and TSP ⋮ Parameterized analysis of the online priority and node-weighted Steiner tree problems

This page was built for publication: The power of deferral