Packing Steiner Trees: Separation Algorithms

DOI10.1137/S0895480193258716MaRDI QIDQ4881289zbMATH OpenFDO

Authors Martin Grötschel, Alexander Martin, Robert Weismantel

Publication date 3 October 1996

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S0895480193258716

zbMATH Keywords

dual graphmulticutsroutingseparationshortest pathSteiner tree packing problemswitchbox routing

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35) Dynamic programming (90C39) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Packing Steiner trees: A cutting plane algorithm and computational results
• Packing Steiner trees: Polyhedral investigations
• The Steiner tree packing problem in VLSI design
• Publication:3484640

Cited in

(11)

• Packing trees in communication networks
• The Steiner tree packing problem in VLSI design
• Packing Steiner trees: Polyhedral investigations
• Packing Steiner trees: A cutting plane algorithm and computational results
• Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs
• scientific article; zbMATH DE number 4156212 (Why is no real title available?)
• scientific article; zbMATH DE number 1342148 (Why is no real title available?)
• Packing element-disjoint steiner trees
• Vertex-disjoint packing of two Steiner trees: polyhedra and branch-and-cut
• Perfect out-forest problem and directed Steiner cycle packing problem
• On routing in VLSI design and communication networks

This page was built for publication: Packing Steiner Trees: Separation Algorithms

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