On the terminal Steiner tree problem

Authors:
Guohui Lin;Guoliang Xue
Affiliations:
Department of Computing Science, University of Alberta, Edmonton, AB. T6G 2E8, Canada;Department of Computer Science and Engineering, Arizona State University, Tempe, AZ
Venue:
Information Processing Letters
Year:
2002

Citing 7
Cited 15

The steiner problem with edge lengths 1 and 2,

Information Processing Letters
On better heuristic for euclidean Steiner minimum trees (extended abstract)

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Improved approximations for the Steiner tree problem

SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
On component-size bounded Steiner trees

Discrete Applied Mathematics - Special volume: Aridam VI and VII, Rutcor, New Brunswick, NJ, USA (1991 and 1992)
The k-Steiner Ratio in Graphs

SIAM Journal on Computing
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 note on the terminal Steiner tree problem

Information Processing Letters
On the partial terminal Steiner tree problem

The Journal of Supercomputing
Algorithms for terminal Steiner trees

Theoretical Computer Science
The Set Connector Problem in Graphs

IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
On the full and bottleneck full Steiner tree problems

COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
A polylogarithmic approximation for computing non-metric terminal Steiner trees

Information Processing Letters
Optimization of the bias current network for accurate on-chip thermal monitoring

Proceedings of the Conference on Design, Automation and Test in Europe
Optimization of the bias current network for accurate on-chip thermal monitoring

Proceedings of the Conference on Design, Automation and Test in Europe
Diameter-constrained steiner tree

COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
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
Minimum diameter cost-constrained Steiner trees

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.90

Visualization

Abstract

We investigate a practical variant of the well-known graph Steiner tree problem. In this variant, every target vertex is required to be a leaf vertex in the solution Steiner tree. We present hardness results for this variant as well as a polynomial time approximation algorithm with performance ratio ρ + 2, where ρ is the best-known approximation ratio for the graph Steiner tree problem.