On the full and bottleneck full Steiner tree problems

Authors:
Yen Hung Chen;Chin Lung Lu;Chuan Yi Tang
Affiliations:
Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan, R.O.C;Department of Biological Science and Technology, National Chiao Tung University, Hsinchu, Taiwan, R.O.C;Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan, R.O.C
Venue:
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Year:
2003

Citing 11
Cited 8

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
Introduction to Algorithms

Introduction to 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
The full steiner tree problem

Theoretical Computer Science

On the partial terminal Steiner tree problem

The Journal of Supercomputing
Algorithms for terminal Steiner trees

Theoretical Computer Science
A polylogarithmic approximation for computing non-metric terminal Steiner trees

Information Processing Letters
On the euclidean bottleneck full Steiner tree problem

Proceedings of the twenty-seventh annual symposium on Computational geometry
An improved approximation algorithm for the terminal Steiner tree problem

ICCSA'11 Proceedings of the 2011 international conference on Computational science and its applications - Volume Part III
Algorithms for terminal steiner trees

COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
The internal Steiner tree problem: Hardness and approximations

Journal of Complexity
On some network design problems with degree constraints

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given a graph G = (V, E) with a length function on edges and a subset R of V, the full Steiner tree is defined to be a Steiner tree in G with all the vertices of R as its leaves. Then the full Steiner tree problem is to find a full Steiner tree in G with minimum length, and the bottleneck full Steiner tree problem is to find a full Steiner tree T in G such that the length of the largest edge in T is minimized. In this paper, we present a new approximation algorithm with performance ratio 2ρ for the full Steiner tree problem, where ρ is the best-known performance ratio for the Steiner tree problem. Moreover, we give an exact algorithm of O(|E| log |E|) time to solve the bottleneck full Steiner tree problem.