Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees

DOI10.1007/11830924_16zbMath1155.68577OpenAlexW2176619219MaRDI QIDQ3595372

Mohammad R. Salavatipour, Mohammad Taghi Hajiaghayi, Guy Kortsarz

Publication date: 28 August 2007

Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11830924_16

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Related Items (2)

Approximating some network design problems with node costs ⋮ When diameter matters: parameterized approximation algorithms for bounded diameter minimum Steiner tree problem

This page was built for publication: Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees