𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An exact algorithm for the node weighted Steiner tree problem

✍ Scribed by Roberto Cordone; Marco Trubian

Publisher
Springer
Year
2006
Tongue
English
Weight
134 KB
Volume
4
Category
Article
ISSN
1619-4500

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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