scientific article; zbMATH DE number 108281

zbMATH Open0763.94029MaRDI QIDQ4023738FDOQ4023738

Authors: Alexander Martin 

Publication date: 23 January 1993

Title of this publication is not available (Why is that?)

Recommendations

• Packing Steiner trees: Polyhedral investigations
• Packing Steiner trees: Further facets
• Steiner tree packing revisited
• Packing the Steiner trees of a graph
• Packing Steiner trees: A cutting plane algorithm and computational results
• Packing Steiner Forests
• scientific article; zbMATH DE number 2079349
• Packing Steiner trees
• Hardness and approximation results for packing Steiner trees
• Algorithms – ESA 2004

zbMATH Keywords

lower boundpacking of Steiner trees

Mathematics Subject Classification ID

Applications of graph theory (05C90) Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Applications of graph theory to circuits and networks (94C15)

Cited In (10)

• Title not available (Why is that?)
• Packing Steiner trees: Polyhedral investigations
• Steiner tree packing revisited
• The cavity approach for Steiner trees packing problems
• Comparison of formulations and a heuristic for packing Steiner trees in a graph
• Title not available (Why is that?)
• The Steiner tree packing problem in VLSI design
• Hardness and approximation results for packing Steiner trees
• Packing Steiner trees: A cutting plane algorithm and computational results
• Routing in grid graphs by cutting planes

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4023738)