Speeding up the Dreyfus-Wagner algorithm for minimum Steiner trees

Mathematical Methods of Operations Research

Volumn 66, Issue 1, 2007, Pages 117-125

  Fuchs, Bernhard ^a   Kern, Walter ^b   Wang, Xinhui ^b  

^a UNIVERSITY OF COLOGNE   (Germany)

^b UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

Dynamic programming; Exact algorithm; Steiner tree

Indexed keywords

ALGORITHMS; DYNAMIC PROGRAMMING; NUMERICAL METHODS; OPTIMIZATION; PROBLEM SOLVING;

DREYFUS-WAGNER ALGORITHMS; EXACT ALGORITHMS; STEINER TREES;

TREES (MATHEMATICS);

EID: 34547356624     PISSN: 14322994     EISSN: 14325217     Source Type: Journal    
DOI: 10.1007/s00186-007-0146-0     Document Type: Article

References (9)

1. Downey RG, Fellows MR (1999) Parameterized complexity. Springer, Berlin
2. Dreyfus SE, Wagner RA (1972) The Steiner problem in graphs. Networks 1:195-207
3. Fößmeier U, Kaufmann M (2000) On exact solutions for the rectilinear Steiner tree problem Part 1: Theoretical results. Algorithmica 26:68-99
4. n) time. In: Proceedings of the 6th Canadian conference on computational geometry, pp 308-313
5. Garey M, Johnson D (1977) The rectilinear Steiner tree problem is NP-complete. SIAM J Appl Math 32(4):826-834
6. Gröpl C, Hougardy S, Nierhoff T, Prömel HJ (2001) Approximation algorithms for the Steiner tree problem in graphs. In: Cheng X, Du D-Z, (eds) Steiner trees in industries. Kluwer, Dordrecht
7. Hwang FK (1976) On Steiner minimal trees with rectilinear distance. SIAM J Appl Math 30(1):104-114
8. Warme DM, Winter P, Zachariasen M (2000) Exact algorithms for plane Steiner tree problems: a computational study. In: Du DZ, Smith JM, Rubinstein JH (eds) Advances in Steiner trees. Kluwer, Dordrecht
9. Zachariasen M (2001) The Rectilinear Steiner tree problem: A tutorial. In: Cheng X, Du D-Z (eds) Steiner trees in industries. Kluwer, Dordrecht