Sciweavers

Share
COCOON
2005
Springer

Algorithms for Terminal Steiner Trees

9 years 3 months ago
Algorithms for Terminal Steiner Trees
The terminal Steiner tree problem (TST) consists of finding a minimum cost Steiner tree where each terminal is a leaf. We describe a factor 2ρ−ρ/(3ρ−2) approximation algorithm for the TST, where ρ is the approximation factor of a given algorithm for the Steiner tree problem. Considering the current best value of ρ, this improves a previous 3.10 factor to 2.52. For the TST restricted to instances where all edge costs are either 1 or 2, we improve
Fábio Viduani Martinez, José Coelho
Added 26 Jun 2010
Updated 26 Jun 2010
Type Conference
Year 2005
Where COCOON
Authors Fábio Viduani Martinez, José Coelho de Pina, José Soares
Comments (0)
books