Packing Steiner trees: Separation algorithms

SIAM Journal on Discrete Mathematics

Volumn 9, Issue 2, 1996, Pages 233-257

  Grotschel M ^a   Martin, A ^a   Weismantel, R ^a  

^a ZUSE INSTITUTE BERLIN   (Germany)

Author keywords

Dual graph; Dynamic programming; Multicuts; Separation; Shortest path; Steiner tree

Indexed keywords

DYNAMIC PROGRAMMING;

COMBINATORIAL OPTIMIZATION; GRAPH PATH; POLYNOMIAL TIME; POLYTOPE; SHORTEST PATH; STEINER SYSTEM;

ALGORITHMS;

EID: 0030351483     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480193258716     Document Type: Article

References (16)

1. R. K. AHUJA, T. L. MAGNANTI, AND J. B. ORLIN, Network Flows: Theory, Algorithms, and Applications, Prentice-Hall, Englewood Cliffs, NJ, 1993.
2. M. BURSTEIN AND R. PELAVIN, Hierarchical wire routing, IEEE Trans. Computer-Aided-Design, 2 (1983), pp. 223-234.
3. J. P. COHOON AND P. L. HECK, BEAVER: A computational-geometry-based tool for switchbox routing, IEEE Trans. Computer-Aided-Design, 7 (1988), pp. 684-697.
4. S. E. DREYFUS AND R. A. WAGNER, The Steiner problem in graphs, Networks, 1 (1971), pp. 195-207.
5. R. E. ERICKSON, C. L. MONMA, AND A. F. VEINOTT, Send-and-split method for minimum concave-cost network flows, Math. Oper. Res., 12 (1987), pp. 634-664.
6. M. GRÖTSCHEL AND C. L. MONMA, Integer polyhedra associated with certain network design problems with connectivity constraints, SIAM J. Discrete Math., 3 (1990), pp. 502-523.
7. M. GRÖTSCHEL, C. L. MONMA, AND M. STOER, Computational results with a cutting plane algorithm for designing communication networks with low-connectivity constraints, Oper. Res., 40 (1992), pp. 309-330.
8. M. GRÖTSCHEL, A. MARTIN, AND R. WEISMANTEL, Packing Steiner Trees: Polyhedral Investigations, preprint SC 92-8, Konrad-Zuse-Zentrum für Informationstechnik Berlin, 1992, Mathematical Programming, to appear.
9. Packing Steiner trees: A Cutting Plane Algorithm and Computational Results, preprint SC 92-9, Konrad-Zuse-Zentrum für Informationstechnik Berlin, 1992; Math. Programming, to appear.
10. Packing Steiner trees: Further facets, European J. Combin., 17 (1995), pp. 39-52.
11. F. K. HWANG, D. S. RICHARDS, AND P. WINTER, The Steiner Tree Problem, Annals of Discrete Mathematics 53, North-Holland, Amsterdam, 1992.
12. M. R. KRAMER AND J. VAN LEEUWEN, The complexity of wire-routing and finding minimum area layouts for arbitrary VLSI circuits, in Advances in Computing Research, Vol. 2: VLSI Theory, F. P. Preparata, ed., Jai Press, London, 1984, pp. 129-146.
13. W. K. LUK, A greedy switch-box router, Integration, 3 (1985), pp. 129-149.
14. A. MARTIN, Packen von Steinerbäumen: Polyedrische Studien und Anwendung, Ph.D. thesis, Technische Universität Berlin, 1992.
15. M. SARRAFZADEH, Channel-routing problem in the knock-knee mode is script N signP-complete, IEEE Trans. Computer-Aided-Design, 6 (1987), pp. 503-506.
16. H. TAKAHASHI AND A. MATSUYAMA, An approximate solution for the Steiner problem in graphs, Math. Japon., 24 (1980), pp. 573-577.