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.
KeywordsLocal Search Minimum Span Tree Steiner Tree Local Search Algorithm Steiner Tree Problem
Unable to display preview. Download preview PDF.
- J.E. Beasley. OR-Library: Distributing test problems by electronic mail. Journal of the Operations Research Society, 41:1069–1072, 1990.Google Scholar
- B.M.E. Moret and H.D. Shapiro. Algorithms from P to NP. Volume I: Design and Efficiency. Benjamin-Cummings, Menlo Park, CA, 1991.Google Scholar
- M.G.A. Verhoeven, E.H.L. Aarts, and M.E.M. Severens. Local search for the Steiner problem in graphs. In V.J. Rayward-Smith, editor, Modern Heuristic Search Methods. J. Wiley, 1996.Google Scholar
- M Yannakakis. The analysis of local search problems and their heuristics. In Proceedings of the seventh Symposium on Theoretical Aspects of Computer Science, volume LNCS 415, pages 298–311, Berlin, 1990. Springer-Verlag.Google Scholar