Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs
DOI10.1007/978-3-642-03685-9_1zbMATH Open1254.68350OpenAlexW2142756199MaRDI QIDQ3638865FDOQ3638865
Authors: Ashkan Aazami, K. R. Jampani, 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
Recommendations
- Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs
- Packing element-disjoint steiner trees
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Approximation algorithms for packing element-disjoint Steiner trees on bounded terminal nodes
- A graph reduction step preserving element-connectivity and packing Steiner trees and forests
Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Cited In (8)
- Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs
- Packing element-disjoint steiner trees
- Title not available (Why is that?)
- A graph reduction step preserving element-connectivity and packing Steiner trees and forests
- Approximation algorithms for packing element-disjoint Steiner trees on bounded terminal nodes
- A Graph Reduction Step Preserving Element-Connectivity and Applications
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Hardness and approximation results for packing Steiner trees
This page was built for publication: Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3638865)
