Online Degree-Bounded Steiner Network Design
From MaRDI portal
Publication:4575589
DOI10.1137/1.9781611974331.ch13zbMath1410.68293arXiv1704.05430OpenAlexW2949251659MaRDI QIDQ4575589
Vahid Liaghat, Soheil Ehsani, Sina Dehghani, Mohammad Taghi Hajiaghayi
Publication date: 16 July 2018
Published in: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1704.05430
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Online algorithms; streaming algorithms (68W27)
Related Items (2)
Bounded Degree Group Steiner Tree Problems ⋮ On approximating degree-bounded network design problems
This page was built for publication: Online Degree-Bounded Steiner Network Design
