Packing Steiner Forests

DOI10.1007/11496915_27zbMATH Open1119.90362OpenAlexW1483101602MaRDI QIDQ3596337FDOQ3596337

Authors: Lap Chi Lau 

Publication date: 30 August 2007

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11496915_27

Recommendations

• An approximate max-Steiner-tree-packing min-Steiner-cut theorem
• scientific article; zbMATH DE number 2079349
• Packing the Steiner trees of a graph
• Packing Steiner trees
• A graph reduction step preserving element-connectivity and packing Steiner trees and forests

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (10)

• An approximate max-Steiner-tree-packing min-Steiner-cut theorem
• The cavity approach for Steiner trees packing problems
• Colored Non-crossing Euclidean Steiner Forest
• Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Hardness and approximation results for packing Steiner trees
• Packing Steiner trees: A cutting plane algorithm and computational results
• On routing in VLSI design and communication networks
• Packing trees in communication networks

This page was built for publication: Packing Steiner Forests

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3596337)