Packing Steiner Forests

DOI10.1007/11496915_27MaRDI QIDQ3596337zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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

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

Cited in

(11)

• Packing trees in communication networks
• Packing Steiner trees: A cutting plane algorithm and computational results
• Hardness and approximation results for packing Steiner trees
• The cavity approach for Steiner trees packing problems
• Colored Non-crossing Euclidean Steiner Forest
• scientific article; zbMATH DE number 108281 (Why is no real title available?)
• scientific article; zbMATH DE number 2079349 (Why is no real title available?)
• Multi-qubit lattice surgery scheduling
• An approximate max-Steiner-tree-packing min-Steiner-cut theorem
• On routing in VLSI design and communication networks
• Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs

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)