On the implementation of mst-based heuristics for the steiner problem in graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2409, Issue , 2002, Pages 1-15

  de Aragão, Marcus Poggi ^a   Werneck, Renato F ^a,b  

^a PONTIFICAL CATHOLIC UNIVERSITY OF RIO DE JANEIRO   (Brazil)

^b Princeton University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; COMPUTATIONAL COMPLEXITY; TREES (MATHEMATICS);

CLASSIC ALGORITHM; COMPUTATION TIME; CONSTANT FACTORS; EFFICIENT IMPLEMENTATION; MINIMUM SPANNING TREE PROBLEM; S-ALGORITHMS; STEINER PROBLEMS; WORST-CASE COMPLEXITY; RUNNING TIME;

TREES (MATHEMATICS); ALGORITHMS;

EID: 77953087446     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45643-0_1     Document Type: Conference Paper

References (13)

1. R. Ahuja, T. Magnanti, and J. Orlin. Network Flows: Theory, algorithms, and applications. Prentice-Hall, 1993.
2. C. Duin and S. Voss. The Pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs. Networks, 34:181–191, 1999.
3. F. Hwang, D. Richards, and P. Winter. The Steiner tree problem, volume 53 of Annals of Discrete Mathematics. North-Holland, Amsterdam, 1992.
4. T. Koch and A. Martin. Solving Steiner tree problems in graphs to optimality. Networks, 32:207–232, 1998.
5. T. Koch, A. Martin, and S. Voss. SteinLib: An updated library on Steiner tree problems in graphs. Technical Report ZIB-Report 00-37, Konrad-Zuse-Zentrum für Informationstechnik Berlin, 2000. http://elib.zib.de/steinlib.
6. K. Melhorn. A faster approximation algorithm for the Steiner problem in graphs. Information Processing Letters, 27:125–128, 1988.
7. B. M. E. Moret and H. D. Shapiro. An empirical assessment of algorithms for constructing a minimum spanning tree. DIMACS Monographs in Discrete Mathematics and Theoretical Computer Science, 15:99–117, 1994.
8. T. Polzin and S. V. Daneshmand. Improved algorithms for the Steiner problem in networks. Discrete Applied Mathematics, 112(1–3):263–300, 2001.
9. F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, 1985.
10. C. C. Ribeiro, E. Uchoa, and R. F. Werneck. A hybrid GRASP with perturbations for the Steiner problem in graphs. INFORMS Journal on Computing, to appear.
11. H. Takahashi and A. Matsuyama. An approximate solution for the Steiner problem in graphs. Math. Japonica, 24:573–577, 1980.
12. S. Voss. Steiner’s problem in graphs: Heuristic methods. Discrete Applied Mathematics, 40:45–72, 1992.
13. S.M. Wang. A multiple source algorithm for suboptimum Steiner trees in graphs. In H. Noltemeier, editor, Proceedings of the International Workshop on Graph-Theoretic Concepts in Computer Science, pages 387–396. Wu¨rzburg, 1985.