Packing Steiner trees: Further facets

DOI10.1006/EUJC.1996.0004MaRDI QIDQ1908272zbMATH OpenOpenAlexFDO

Authors Alexander Martin, Martin Grötschel, Robert Weismantel

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

Steiner treepathcutting 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)

Recommendations

• Packing Steiner trees: Polyhedral investigations
• The Steiner tree polytope and related polyhedra
• Steiner trees and polyhedra
• Publication:3484640
• scientific article; zbMATH DE number 2079349

Cited in

(19)

• Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs
• Packing Steiner trees: Polyhedral investigations
• Steiner tree packing revisited
• Facet-inducing inequalities with acyclic supports for the caterpillar-packing polytope
• Packing element-disjoint steiner trees
• Chvátal-Gomory cuts for the Steiner tree problem
• 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
• scientific article; zbMATH DE number 108281 (Why is no real title available?)
• The Steiner tree packing problem in VLSI design
• scientific article; zbMATH DE number 2196275 (Why is no real title available?)
• Packing Steiner trees: A cutting plane algorithm and computational results
• Hardness and approximation results for packing Steiner trees
• A branch-and-price algorithm for the Steiner tree packing problem.
• 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)