Packing Steiner Trees: Separation Algorithms

DOI10.1137/S0895480193258716zbMath0846.90119MaRDI QIDQ4881289

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 pathmulticutsseparationroutingswitchbox routingdual graphSteiner tree packing problem

Mathematics Subject Classification ID

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

Related Items

The Steiner tree packing problem in VLSI design, Packing Steiner trees: A cutting plane algorithm and computational results, Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs, On routing in VLSI design and communication networks, Packing trees in communication networks