𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Steiner tree reoptimization in graphs with sharpened triangle inequality

✍ Scribed by Hans-Joachim Böckenhauer; Karin Freiermuth; Juraj Hromkovič; Tobias Mömke; Andreas Sprock; Björn Steffen

Book ID
113699041
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
404 KB
Volume
11
Category
Article
ISSN
1570-8667

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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