Steiner Tree Heuristics — A Survey

Given a graph with weights on its edges Steiner’s problem in graphs is to determine a minimum cost subgraph spanning a set of specified vertices. Real world problems arising in the layout of connection structures in networks as, e.g., in topological network design or 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. In this paper we give a survey on recent results on heuristic methods for the problem.

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

[2]  A. Volgenant,et al.  Reducing the hierarchical network design problem , 1989 .

[3]  John E. Beasley,et al.  OR-Library: Distributing Test Problems by Electronic Mail , 1990 .

[4]  Reinhard Männer,et al.  On Steiner Trees and Genetic Algorithms , 1989, Parallelism, Learning, Evolution.

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

[6]  Robert E. Tarjan,et al.  Efficient algorithms for finding minimum spanning trees in undirected and directed graphs , 1986, Comb..

[7]  M. Minoux.  Efficient Greedy Heuristics For Steiner Tree Problems Using Reolptimization And Super Modularity , 1990 .

[8]  Alexander Zelikovsky.  An 11/6-Approximation Algorithm for the Steiner Problem on Graphs , 1992 .

[9]  C. W. Duin,et al.  HEURISTIC METHODS FOR THE RECTILINEAR STEINER ARBORESCENCE PROBLEM , 1993 .

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

[11]  Ján Plesník.  On Some Heuristics for the Steiner Problem in Graphs , 1992 .

[12]  Ding-Zhu Du,et al.  On better heuristics for Steiner minimum trees , 1992, Math. Program..

[13]  M. R. Rao,et al.  Solving the Steiner Tree Problem on a Graph Using Branch and Cut , 1992, INFORMS J. Comput..

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

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

[16]  Stefan Voß,et al.  Steiner's Problem in Graphs: Heuristic Methods , 1992, Discret. Appl. Math..

[17]  Billy E. Gillett,et al.  A Comparison of Two Simulated Annealing Algorithms Applied to the Directed Steiner Problem on Networks , 1991, INFORMS J. Comput..

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

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

[20]  J. Plesnik.  WORST-CASE RELATIVE PERFORMANCES OF HEURISTICS FOR THE STEINER PROBLEM IN GRAPHS , 1991 .

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

[22]  G. D. Smith,et al.  Solving the Graphical Steiner Tree Problem Using Genetic Algorithms , 1993 .

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

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

[25]  Alfredo Candia-Véjar,et al.  An approach for the Steiner problem in directed graphs , 1991, Ann. Oper. Res..

[26]  K. Dowsland.  HILL-CLIMBING, SIMULATED ANNEALING AND THE STEINER PROBLEM IN GRAPHS , 1991 .

[27]  Ramayya Krishnan,et al.  An in-depth empirical investigation of non-greedy approaches for the minimum spanning tree problem , 1992 .

[28]  Dana S. Richards,et al.  Steiner tree problems , 1992, Networks.

[29]  Ján Plesník.  Heuristics for the Steiner Problem in Graphs , 1992, Discret. Appl. Math..

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

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

[32]  C. C. De Souza,et al.  A tight worst case bound for the performance ratio of heuristics for the minimum rectilinear steiner tree problem , 1990 .

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

[34]  Reinhard Männer,et al.  Optimization of Steiner Trees Using Genetic Algorithms , 1989, International Conference on Genetic Algorithms.

[35]  Y.-B. Ji,et al.  A new scheme for the Steiner problem in graphs , 1988, 1988., IEEE International Symposium on Circuits and Systems.

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