𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Solving Steiner Tree Problems in Graphs with Lagrangian Relaxation

✍ Scribed by Laura Bahiense; Francisco Barahona; Oscar Porto

Book ID
111569030
Publisher
Springer US
Year
2003
Tongue
English
Weight
127 KB
Volume
7
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Solving Steiner tree problems in graphs
Solving Steiner tree problems in graphs to optimality
✍ Koch, T.; Martin, A. πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 261 KB πŸ‘ 2 views

In this paper, we present the implementation of a branch-and-cut algorithm for solving Steiner tree problems in graphs. Our algorithm is based on an integer programming formulation for directed graphs and comprises preprocessing, separation algorithms, and primal heuristics. We are able to solve nea

Approximating Steiner trees in graphs wi
Approximating Steiner trees in graphs with restricted weights
✍ HalldοΏ½rsson, MagnοΏ½s M.; Ueno, Shuichi; Nakao, Hiroshi; Kajitani, Yoji πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 128 KB πŸ‘ 2 views

We analyze the approximation ratio of the average distance heuristic for the Steiner tree problem on graphs and prove nearly tight bounds for the cases of complete graphs with binary weights {1, d} or weights in the interval [1, d], where d Β°2. The improvement over other analyzed algorithms is a fac