Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs
From MaRDI portal
Publication:3638865
DOI10.1007/978-3-642-03685-9_1zbMath1254.68350OpenAlexW2142756199MaRDI QIDQ3638865
K. R. Jampani, Ashkan Aazami, Joseph Cheriyan
Publication date: 28 October 2009
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/978-3-642-03685-9_1
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
This page was built for publication: Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs