scientific article; zbMATH DE number 508829

zbMATH Open0787.94026MaRDI QIDQ4280133FDOQ4280133

Authors: Alexander Martin, Robert Weismantel 

Publication date: 24 May 1994

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

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

zbMATH Keywords

polyhedronpolytopesrouting problemelectronic circuitsSteiner tree packing problem

Mathematics Subject Classification ID

Cited In (5)

• Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs
• Title not available (Why is that?)
• Hardness and approximation results for packing Steiner trees
• On routing in VLSI design and communication networks
• Packing trees in 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)