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)

zbMATH Keywords

shortest pathroutingseparationdual graphmulticutsswitchbox routingSteiner tree packing problem

Mathematics Subject Classification ID

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

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

(8)

• Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs
• Packing element-disjoint steiner trees
• scientific article; zbMATH DE number 4156212 (Why is no real title available?)
• The Steiner tree packing problem in VLSI design
• Vertex-disjoint packing of two Steiner trees: polyhedra and branch-and-cut
• 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 Trees: Separation Algorithms

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