Abstract
We study approximation algorithms and hardness of approximation for several versions of the problem of packing Steiner trees. For packing edge-disjoint Steiner trees of undirected graphs, we show APX-hardness for 4 terminals. For packing Steiner-node-disjoint Steiner trees of undirected graphs, we show a logarithmic hardness result, and give an approximation guarantee of O(n log n), where n denotes the number of nodes. For the directed setting (packing edge-disjoint Steiner trees of directed graphs), we show a hardness result of Ω(m1/3-ε) and give an approximation guarantee of O(m 1/2+ε), where m denotes the number of edges. The paper has several other results. © Springer-Verlag 2004.
Cite
CITATION STYLE
Cheriyan, J., & Salavatipour, M. R. (2004). Hardness and approximation results for packing steiner trees. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3221, 180–191. https://doi.org/10.1007/978-3-540-30140-0_18
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
