Online Network Design Algorithms via Hierarchical Decompositions
From MaRDI portal
Publication:5363006
DOI10.1137/1.9781611973730.91zbMath1372.68312arXiv1410.4240OpenAlexW2949813243MaRDI QIDQ5363006
Publication date: 5 October 2017
Published in: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1410.4240
Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Online algorithms; streaming algorithms (68W27)
Related Items (10)
Tight bounds for online weighted tree augmentation ⋮ On generalizations of the parking permit problem and network leasing problems ⋮ Group parking permit problems ⋮ Unnamed Item ⋮ Dynamic Balanced Graph Partitioning ⋮ On the Facility Location Problem in Online and Dynamic Models. ⋮ Online constrained forest and prize-collecting network design ⋮ A randomized \(O(\log n)\)-competitive algorithm for the online connected facility location problem ⋮ Designing Networks with Good Equilibria under Uncertainty ⋮ Tight Bounds for Online Weighted Tree Augmentation
This page was built for publication: Online Network Design Algorithms via Hierarchical Decompositions
