scientific article; zbMATH DE number 508829

MaRDI QIDQ4280133zbMATH OpenFDO

Authors Alexander Martin, Robert Weismantel

Publication date 24 May 1994

zbMATH Keywords

electronic circuitspolyhedronpolytopesrouting problemSteiner tree packing problem

Mathematics Subject Classification ID

Recommendations

• Packing Steiner trees: Polyhedral investigations
• The Steiner tree packing problem in VLSI design
• scientific article; zbMATH DE number 108281
• Two Steiner tree packing problems

Cited in

(8)

• Packing trees in communication networks
• Packing Steiner trees: Polyhedral investigations
• Hardness and approximation results for packing Steiner trees
• Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs
• Two Steiner tree packing problems
• scientific article; zbMATH DE number 1538622 (Why is no real title available?)
• The Fermat-Torricelli problem revisited
• On routing in VLSI design and communication networks

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 Q4280133)