Packing Steiner trees: Further facets

DOI10.1006/eujc.1996.0004zbMath0841.05078OpenAlexW2080978495MaRDI QIDQ1908272

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

zbMATH Keywords

pathSteiner treecutting plane algorithmSteiner tree packingSteiner tree packing polyhedron

Mathematics Subject Classification ID

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)

Related Items

Packing Steiner trees: Polyhedral investigations, Steiner tree packing revisited, Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs, Mathematical methods for physical layout of printed circuit boards: an overview