𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Approximations for node-weighted Steiner tree in unit disk graphs

✍ Scribed by X. Xu; Y. Wang; H. Du; P.-J. Wan; F. Zou; X. Li; W. Wu

Book ID
107403285
Publisher
Springer-Verlag
Year
2010
Tongue
English
Weight
220 KB
Volume
4
Category
Article
ISSN
1862-4472

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