𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Node-weighted Steiner tree approximation in

✍ Scribed by Feng Zou; Xianyue Li; Suogang Gao; Weili Wu

Publisher
Springer US
Year
2009
Tongue
English
Weight
299 KB
Volume
18
Category
Article
ISSN
1382-6905

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

A strong lower bound for the Node Weight
A strong lower bound for the Node Weighted Steiner Tree Problem
✍ Engevall, Stefan; GοΏ½the-Lundgren, Maud; VοΏ½rbrand, Peter πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 84 KB πŸ‘ 1 views

In this paper, we study the Node Weighted Steiner Tree Problem (NSP). This problem is a generalization of the Steiner tree problem in the sense that vertex weights are considered. Given an undirected graph, the problem is to find a tree that spans a subset of the vertices and is such that the total