An improved approximation algorithm for the terminal Steiner tree problem

Authors:
Yen Hung Chen
Affiliations:
Department of Computer Science, Taipei Municipal University of Education, Taipei, Taiwan, R.O.C.
Venue:
ICCSA'11 Proceedings of the 2011 international conference on Computational science and its applications - Volume Part III
Year:
2011

Citing 18
Cited 1

The steiner problem with edge lengths 1 and 2,

Information Processing Letters
A faster approximation algorithm for the Steiner tree problem in graphs

Information Processing Letters
Improved approximations for the Steiner tree problem

SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
The k-Steiner Ratio in Graphs

SIAM Journal on Computing
On wirelength estimations for row-based placement

ISPD '98 Proceedings of the 1998 international symposium on Physical design
A 1.598 approximation algorithm for the Steiner problem in graphs

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Improved Steiner tree approximation in graphs

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
A new approximation algorithm for the Steiner tree problem with performance ratio 5/3

Journal of Algorithms
On the terminal Steiner tree problem

Information Processing Letters
Better approximation bounds for the network and Euclidean Steiner tree problems

Better approximation bounds for the network and Euclidean Steiner tree problems
A note on the terminal Steiner tree problem

Information Processing Letters
The full steiner tree problem

Theoretical Computer Science
Tighter Bounds for Graph Steiner Tree Approximation

SIAM Journal on Discrete Mathematics
On the partial terminal Steiner tree problem

The Journal of Supercomputing
Note: Approximating the selected-internal Steiner tree

Theoretical Computer Science
Algorithms for terminal Steiner trees

Theoretical Computer Science
Steiner Tree Problems In Computer Communication Networks

Steiner Tree Problems In Computer Communication Networks
On the full and bottleneck full Steiner tree problems

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

Minimum diameter cost-constrained Steiner trees

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given a complete graph G = (V,E) with a length function on edges and a subset R of V, the terminal Steiner tree is defined to be a Steiner tree in G with all the vertices of R as its leaves. Then the terminal Steiner tree problem is to find a terminal Steiner tree in G with minimum length. In this paper, we present an approximation algorithm with performance ratio 2ρ - (ρα2 - αρ)/(α+α2)(ρ-1)+2(α-1)2 for the terminal Steiner tree problem, where ρ is the best-known performance ratio for the Steiner tree problem with any α ≥ 2. When we let α = 3.87 ≈ 4, this result improves the previous performance ratio of 2.515 to 2.458.