Packing Steiner Trees: Separation Algorithms
From MaRDI portal
Publication:4881289
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
Cited in
(8)- scientific article; zbMATH DE number 4156212 (Why is no real title available?)
- Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs
- On routing in VLSI design and communication networks
- Packing Steiner trees: A cutting plane algorithm and computational results
- Vertex-disjoint packing of two Steiner trees: polyhedra and branch-and-cut
- Packing element-disjoint steiner trees
- Packing trees in communication networks
- The Steiner tree packing problem in VLSI design
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)