A Graph Reduction Step Preserving Element-Connectivity and Packing Steiner Trees and Forests

DOI10.1137/120882147zbMath1302.05139OpenAlexW2056906942MaRDI QIDQ3192151

Nitish Korula, Chandra Chekuri

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

zbMATH Keywords

packingSteiner treesSteiner forestselement-connectivityelement-disjointSteiner trees and forests

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

Related Items (3)

On Element-Connectivity Preserving Graph Simplification ⋮ Towards tight(er) bounds for the excluded grid theorem ⋮ A note on degree vs gap of Min-Rep label cover and improved inapproximability for connectivity problems

This page was built for publication: A Graph Reduction Step Preserving Element-Connectivity and Packing Steiner Trees and Forests