On Steiner trees and minimum spanning trees in hypergraphs

Operations Research Letters

Volumn 31, Issue 1, 2003, Pages 12-20

  Polzin, Tobias ^a   Vahdati Daneshmand, Siavash ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b UNIVERSITY OF MANNHEIM   (Germany)

Author keywords

Linear programming; Relaxation; Steiner problem

Indexed keywords

ALGORITHMS; LINEAR PROGRAMMING; OPERATIONS RESEARCH; PROBLEM SOLVING;

HYPERGRAPHS;

TREES (MATHEMATICS);

EID: 0037211669     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(02)00185-2     Document Type: Article

References (15)

1. Aneja Y.P. An integer linear programming approach to the Steiner problem in graphs. Networks. 10:1980;167-178.
2. Hwang F.K., Richards D.S., Winter P. The Steiner Tree Problem. Annals of Discrete Mathematics. Vol. 53:1992;North-Holland, Amsterdam.
3. Koch T., Martin A. Solving Steiner tree problems in graphs to optimality. Networks. 32:1998;207-232.
4. T. Koch, A. Martin, SteinLib, http://elib.zib.de/steinlib/steinlib.php, 2001.
5. T.L. Magnanti, L.A. Wolsey, Optimal trees, in: M.O. Ball, et al. (Eds.), Handbooks in Operations Research and Management Science, Vol. 7, Elsevier Science, Amsterdam, 1995 (Chapter 9).
6. Polzin T., Vahdati Daneshmand S. A comparison of Steiner tree relaxations. Discrete Appl. Math. 112:2001;241-261.
7. T. Polzin, S. Vahdati Daneshmand, Extending reduction techniques for the Steiner tree problem: a combination of alternative- and bound-based approaches, Research Report MPI-I-2001-1-007, Max-Planck-Institut für Informatik, Stuhlsatzenhausweg 85, 66123 Saarbrücken, Germany, 2001.
8. Polzin T., Vahdati Daneshmand S. Improved algorithms for the Steiner problem in networks. Discrete Appl. Math. 112:2001;263-300.
9. T. Polzin, S. Vahdati Daneshmand, On Steiner trees and minimum spanning trees in hypergraphs, Research Report MPI-I-2001-1-005, Max-Planck-Institut für Informatik, Stuhlsatzenhausweg 85, 66123 Saarbrücken, Germany, 2001.
10. T. Polzin, S. Vahdati Daneshmand, Partitioning techniques for the Steiner problem, Research Report MPI-I-2001-1-006, Max-Planck-Institut für Informatik, Stuhlsatzenhausweg 85, 66123 Saarbrücken, Germany, 2001.
11. T. Polzin, S. Vahdati Daneshmand, Using (sub)graphs of small width for solving the Steiner problem, Research Report MPI-I-2002-1-001, Max-Planck-Institut für Informatik, Stuhlsatzenhausweg 85, 66123 Saarbrücken, Germany, 2002.
12. D.M. Warme, Spanning Trees in Hypergraphs with Applications to Steiner Trees, Ph.D. Thesis, University of Virginia, 1998.
13. Warme D.M., Winter P., Zachariasen M. Exact algorithms for plane Steiner tree problems: a computational study. Du D-Z., Smith J.M., Rubinstein J.H. Advances in Steiner Trees. 2000;81-116 Kluwer Academic Publishers, Dordrecht.
14. D.M. Warme, P. Winter, M. Zachariasen, GeoSteiner 3.1. http://www.diku.dk/geosteiner/, 2001.
15. Wong R.T. A dual ascent approach for Steiner tree problems on a directed graph. Math. Programming. 28:1984;271-287.