Packing Steiner trees: Further facets
DOI10.1006/EUJC.1996.0004zbMATH Open0841.05078OpenAlexW2080978495MaRDI QIDQ1908272FDOQ1908272
Alexander Martin, Robert Weismantel, Martin Grötschel
Publication date: 14 July 1996
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/d9d4143501a2349fa3c64a8daaec25660ee169e4
Recommendations
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (17)
- Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs
- Packing Steiner trees: Polyhedral investigations
- Steiner tree packing revisited
- Packing element-disjoint steiner trees
- Packings and Steiner systems in polar spaces
- Mathematical methods for physical layout of printed circuit boards: an overview
- The cavity approach for Steiner trees packing problems
- Comparison of formulations and a heuristic for packing Steiner trees in a graph
- The Steiner tree problem. II: Properties and classes of facets
- Steiner trees and polyhedra
- Title not available (Why is that?)
- The Steiner tree packing problem in VLSI design
- Title not available (Why is that?)
- A branch-and-price algorithm for the Steiner tree packing problem.
- Hardness and approximation results for packing Steiner trees
- Packing Steiner trees: A cutting plane algorithm and computational results
- Packing trees in communication networks
This page was built for publication: Packing Steiner trees: Further facets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1908272)
