Effective Local Search Techniques for the Steiner Tree Problem

2000 ◽  
pp. 255-281 ◽  
Author(s):  
A. S. C. Wade ◽  
V. J. Rayward-Smith
Keyword(s):  
Local Search ◽  
Steiner Tree ◽  
Steiner Tree Problem ◽  
Search Techniques

scholarly journals On the Steiner Tree 3/2-Approximation for Quasi-Bipartite Graphs

1999 ◽  
Vol 6 (39) ◽  
Author(s):  
Romeo Rizzi
Keyword(s):  
Approximation Algorithms ◽  
Approximation Algorithm ◽  
Local Search ◽  
Key Words ◽  
Steiner Tree ◽  
Minimum Weight ◽  
Bipartite Graphs ◽  
Simple Graph ◽  
Steiner Tree Problem ◽  
Stable Set

<p>Let G = (V,E) be an undirected simple graph and w : E -> R+ be<br />a non-negative weighting of the edges of G. Assume V is partitioned<br />as R union X. A Steiner tree is any tree T of G such that every node<br />in R is incident with at least one edge of T. The metric Steiner tree<br />problem asks for a Steiner tree of minimum weight, given that w is a<br />metric. When X is a stable set of G, then (G,R,X) is called quasi-bipartite.<br /> In [1], Rajagopalan and Vazirani introduced the notion of<br />quasi-bipartiteness and gave a ( 3/2 + epsilon) approximation algorithm<br /> for the metric Steiner tree problem, when (G,R,X) is quasi-bipartite. In this<br />paper, we simplify and strengthen the result of Rajagopalan and Vazirani.<br />We also show how classical bit scaling techniques can be adapted<br />to the design of approximation algorithms.</p><p>Key words: Steiner tree, local search, approximation algorithm, bit scaling.</p><p> </p>

Iterated local search algorithms for the Euclidean Steiner tree problem inndimensions

2015 ◽  
Vol 23 (6) ◽  
pp. 1185-1199 ◽  
Author(s):  
Vinícius Leal do Forte ◽  
Flávio Marcelo Tavares Montenegro ◽  
José André de Moura Brito ◽  
Nelson Maculan
Keyword(s):  
Local Search ◽  
Steiner Tree ◽  
Iterated Local Search ◽  
Search Algorithms ◽  
Steiner Tree Problem ◽  
Local Search Algorithms ◽  
Euclidean Steiner Tree Problem

Local search with perturbations for the prize-collecting Steiner tree problem in graphs

Networks ◽  
2001 ◽  
Vol 38 (1) ◽  
pp. 50-58 ◽  
Author(s):  
S. A. Canuto ◽  
M. G. C. Resende ◽  
C. C. Ribeiro
Keyword(s):  
Local Search ◽  
Steiner Tree ◽  
Steiner Tree Problem ◽  
Prize Collecting
Sign in / Sign up

Export Citation Format

Share Document