Online Weighted Degree-Bounded Steiner Networks via Novel Online Mixed Packing/Covering
From MaRDI portal
Publication:4598180
DOI10.4230/LIPIcs.ICALP.2016.42zbMath1388.68223arXiv1704.05811OpenAlexW2964017140MaRDI QIDQ4598180
Saeed Seddighin, Soheil Ehsani, Sina Dehghani, Harald Räcke, Vahid Liaghat, Mohammad Taghi Hajiaghayi
Publication date: 19 December 2017
Full work available at URL: https://arxiv.org/abs/1704.05811
Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) 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 Weighted Degree-Bounded Steiner Networks via Novel Online Mixed Packing/Covering