Algorithms for terminal steiner trees

Authors:
Fábio Viduani Martinez;José Coelho de Pina;José Soares
Affiliations:
Universidade Federal de Mato Grosso do Sul, Brazil;Universidade de São Paulo, Brazil;Universidade de São Paulo, Brazil
Venue:
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Year:
2005

Citing 7
Cited 1

On the size of systems of sets every t of which have an SDR, with an application to the worst-case ratio of heuristics for packing problems

SIAM Journal on Discrete Mathematics
The steiner problem with edge lengths 1 and 2,

Information Processing Letters
Improved Steiner tree approximation in graphs

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
On the terminal Steiner tree problem

Information Processing Letters
A note on the terminal Steiner tree problem

Information Processing Letters
The full steiner tree problem

Theoretical Computer Science
On the full and bottleneck full Steiner tree problems

COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics

The internal Steiner tree problem: Hardness and approximations

Journal of Complexity

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 the approximation factor from 1.60 to 1.42.