A graph reduction step preserving element-connectivity and packing Steiner trees and forests
DOI10.1137/120882147zbMATH Open1302.05139OpenAlexW2056906942MaRDI QIDQ3192151FDOQ3192151
Authors: Chandra Chekuri, Nitish Korula 
Publication date: 26 September 2014
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/120882147
Recommendations
- A Graph Reduction Step Preserving Element-Connectivity and Applications
- Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs
- Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Packing element-disjoint steiner trees
Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial optimization (90C27) Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (8)
- Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs
- A note on degree vs gap of Min-Rep label cover and improved inapproximability for connectivity problems
- On Element-Connectivity Preserving Graph Simplification
- Towards tight(er) bounds for the excluded grid theorem
- Packing Steiner Forests
- The parameterized complexity of the survivable network design problem
- Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs
- A Graph Reduction Step Preserving Element-Connectivity and Applications
This page was built for publication: A graph reduction step preserving element-connectivity and packing Steiner trees and forests
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3192151)
