Two Steiner tree packing problems

DOI10.1145/225058.225163MaRDI QIDQ4234086zbMATH OpenOpenAlexFDO

Authors William R. Pulleyblank

Publication date 1995

Published in Proceedings of the twenty-seventh annual ACM symposium on Theory of computing - STOC '95 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/225058.225163

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Programming involving graphs or networks (90C35) Applications of graph theory to circuits and networks (94C15)

Recommendations

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

Cited in

(8)

• Packing trees in communication networks
• Two packing problems on \(k\)-matroid trees
• Comparison of formulations and a heuristic for packing Steiner trees in a graph
• scientific article; zbMATH DE number 4191148 (Why is no real title available?)
• The cavity approach for Steiner trees packing problems
• scientific article; zbMATH DE number 508829 (Why is no real title available?)
• scientific article; zbMATH DE number 1538622 (Why is no real title available?)
• On routing in VLSI design and communication networks

This page was built for publication: Two Steiner tree packing problems

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