Effective Local Search Techniques for the Steiner Tree Problem

Steiner’s Problem in Graphs (SPG) involves connecting a given subset of a graph’s vertices as cheaply as possible. More precisely, given a graph G = (V, E) with vertices V, edges E, a cost function c: E → Z +, and a set of special vertices, K ⊆ V, a Steiner tree is a connected subgraph, T = (V T , E T ), such that K ⊆ V T ⊆ V and |E| T =|V T |-1. The problem is to find a Steiner tree T which minimises the cost function, Such a tree is referred to as a minimal Steiner tree.

[1]  Mihalis Yannakakis,et al.  The Analysis of Local Search Problems and Their Heuristics , 1990, STACS.

[2]  Victor J. Rayward-Smith,et al.  Modern Heuristic Search Methods , 1996 .

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

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

[5]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

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

[7]  S. E. Dreyfus,et al.  The steiner problem in graphs , 1971, Networks.

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

[9]  Henry D. Shapiro,et al.  Algorithms from P to NP , 1991 .

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

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

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

[13]  A. Pan,et al.  On Finding and Updating Spanning Trees and Shortest Paths , 1975, SIAM J. Comput..

[14]  S. Louis Hakimi,et al.  Steiner's problem in graphs and its implications , 1971, Networks.

[15]  Henrik Esbensen,et al.  Computing near-optimal solutions to the steiner problem in a graph using a genetic algorithm , 1995, Networks.

[16]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[17]  Raymond E. Miller,et al.  Complexity of Computer Computations , 1972 .

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