Steiner's Problem in Graphs: Heuristic Methods

Abstract Real world problems arising in the layout of connection structures in networks as e.g. in VLSI design may often be decomposed into a number of well-known combinatorial optimization problems. Steiner's problem in graphs is included within this context. According to its complexity one is interested in developing efficient heuristic algorithms to find good approximate solutions. Here a comparison of various heuristic methods for Steiner's problem in graphs is presented.

[1]  Anantaram Balakrishnan,et al.  Problem reduction methods and a tree generation algorithm for the steiner network problem , 1987, Networks.

[2]  Alex Zelikovsky.  A Faster Approximation Algorithm for the Steiner Tree Problem in Graphs , 1993, Inf. Process. Lett..

[3]  J. Plesník.  A bound for the Steiner tree problem in graphs , 1981 .

[4]  John E. Beasley.  An algorithm for the steiner problem in graphs , 1984, Networks.

[5]  Gunther Schmidt,et al.  Proceedings of the International Workshop on Graphtheoretic Concepts in Computer Science , 1986 .

[6]  J. David Schaffer,et al.  Proceedings of the third international conference on Genetic algorithms , 1989 .

[7]  J. Kruskal.  On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[8]  Pawel Winter,et al.  Steiner problem in networks: A survey , 1987, Networks.

[9]  Victor J. Rayward-Smith,et al.  On finding steiner vertices , 1986, Networks.

[10]  R. Prim.  Shortest connection networks and some generalizations , 1957 .

[11]  Victor J. Rayward-Smith,et al.  Steiner problems in graphs: algorithms and applications , 1983 .

[12]  V. J. Rayward-Smith,et al.  The computation of nearly minimal Steiner trees in graphs , 1983 .

[13]  Peter Widmayer,et al.  An Approximation Algorithms for Steiner's Problem in Graphs , 1986, WG.

[14]  A. Volgenant,et al.  An edge elimination test for the steiner problem in graphs , 1989 .

[15]  B. Korte,et al.  Zur Bedeutung der diskreten Mathematik für die Konstruktion hochintegrierter Schaltkreise , 1987 .

[16]  J. E. Beasley.  An SST-based algorithm for the steiner problem in graphs , 1989, Networks.

[17]  S Ma.  THE STEINER TREE PROBLEM ON GRAPH AND ITS HEURISTIC ALGORITHM , 1985 .

[18]  H T Lau.  Combinatorial Heuristic Algorithms With Fortran , 1986 .

[19]  Stefan Voss,et al.  Steiner-Probleme in Graphen , 1990 .

[20]  A. Volgenant,et al.  Reduction tests for the steiner problem in grapsh , 1989, Networks.

[21]  Yash P. Aneja,et al.  An integer linear programming approach to the steiner problem in graphs , 1980, Networks.

[22]  Choukhmane El-Arbi.  Une heuristique pour le problème de l'arbre de Steiner , 1978 .

[23]  Kurt Mehlhorn,et al.  A Faster Approximation Algorithm for the Steiner Problem in Graphs , 1988, Inf. Process. Lett..

[24]  Richard T. Wong,et al.  A dual ascent approach for steiner tree problems on a directed graph , 1984, Math. Program..

[25]  Makoto Imase,et al.  Worst-Case Performance of Rayward-Smith's Steiner Tree Heuristic , 1988, Inf. Process. Lett..

[26]  Maurizio Talamo,et al.  Near Optimal Algorithms for Finding Minimum Steiner Trees on Random Graphs , 1986, MFCS.