✦ LIBER ✦

Counting Problems Associated With Steiner Trees In Graphs

✍ Scribed by Provan, J. Scott; Chari, Manoj K.

Book ID: 118198111
Publisher: Society for Industrial and Applied Mathematics
Year: 1997
Tongue: English
Weight: 240 KB
Volume: 10
Category: Article
ISSN: 0895-4801
DOI: 10.1137/s0895480194262862

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Solving Steiner Tree Problems in Graphs

Solving Steiner Tree Problems in Graphs with Lagrangian Relaxation

✍ Laura Bahiense; Francisco Barahona; Oscar Porto 📂 Article 📅 2003 🏛 Springer US 🌐 English ⚖ 127 KB

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

Steiner trees in uniformly quasi-biparti

Steiner trees in uniformly quasi-bipartite graphs

✍ Clemens Gröpl; Stefan Hougardy; Till Nierhoff; Hans Jürgen Prömel 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 89 KB

The area of approximation algorithms for the Steiner tree problem in graphs has seen continuous progress over the last years. Currently the best approximation algorithm has a performance ratio of 1.550. This is still far away from 1.0074, the largest known lower bound on the achievable performance r

Local search with perturbations for the

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

✍ S. A. Canuto; M. G. C. Resende; C. C. Ribeiro 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 156 KB

The steiner problem in graphs

✍ S. E. Dreyfus; R. A. Wagner 📂 Article 📅 1971 🏛 John Wiley and Sons 🌐 English ⚖ 567 KB