Sciweavers

Share
CORR
2007
Springer

A Partition-Based Relaxation For Steiner Trees

8 years 10 months ago
A Partition-Based Relaxation For Steiner Trees
The Steiner tree problem is a classical NP-hard optimization problem with a wide range of practical applications. In an instance of this problem, we are given an undirected graph G = (V,E), a set of terminals R ⊆ V, and non-negative costs ce for all edges e ∈ E. Any tree that contains all terminals is called a Steiner tree; the goal is to find a minimum-cost Steiner tree. The vertices V\R are called Steiner vertices. The best approximation algorithm known for the Steiner tree problem is a greedy algorithm due to Robins and Zelikovsky (SIAM J. Discrete Math, 2005); it achieves a performance guarantee of 1 + ln3
Jochen Könemann, David Pritchard, Kunlun Tan
Added 13 Dec 2010
Updated 13 Dec 2010
Type Journal
Year 2007
Where CORR
Authors Jochen Könemann, David Pritchard, Kunlun Tan
Comments (0)
books