Improved Approximations for Buy-at-Bulk and Shallow-Light k-Steiner Trees and (k,2)-Subgraph

DOI10.1007/978-3-642-25591-5_4zbMath1329.68290OpenAlexW1636181092MaRDI QIDQ3104595

Mohammad R. Salavatipour, M. Reza Khani

Publication date: 16 December 2011

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-25591-5_4

Mathematics Subject Classification ID

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

Related Items (1)

When diameter matters: parameterized approximation algorithms for bounded diameter minimum Steiner tree problem

This page was built for publication: Improved Approximations for Buy-at-Bulk and Shallow-Light k-Steiner Trees and (k,2)-Subgraph