An approximation algorithm for a bottleneck k-Steiner tree problem in the Euclidean plane

Authors:
Lusheng Wang;Zimao Li
Affiliations:
Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong;Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong
Venue:
Information Processing Letters
Year:
2002

Citing 5
Cited 8

Bottleneck Steiner Trees in the Plane

IEEE Transactions on Computers
Steiner tree problem with minimum number of Steiner points and bounded edge-length

Information Processing Letters
A new approximation algorithm for the Steiner tree problem with performance ratio 5/3

Journal of Algorithms
A note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points

Information Processing Letters
Approximations for Steiner Trees with Minimum Number of Steiner Points

Journal of Global Optimization

The Euclidean Bottleneck Steiner Tree and Steiner Tree with Minimum Number of Steiner Points

COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Approximation algorithm for bottleneck steiner tree problem in the euclidean plane

Journal of Computer Science and Technology
On Exact Solutions to the Euclidean Bottleneck Steiner Tree Problem

WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Exact Algorithms for the Bottleneck Steiner Tree Problem

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
On exact solutions to the Euclidean bottleneck Steiner tree problem

Information Processing Letters
On the euclidean bottleneck full Steiner tree problem

Proceedings of the twenty-seventh annual symposium on Computational geometry
The euclidean bottleneck steiner path problem

Proceedings of the twenty-seventh annual symposium on Computational geometry
A bottleneck Steiner tree based multi-objective location model and intelligent optimization of emergency logistics systems

Robotics and Computer-Integrated Manufacturing

Quantified Score

Hi-index	0.89

Visualization

Abstract

We study a bottleneck Steiner tree problem: given a set P = {p1, p2 ..., pn} of n terminals in the Euclidean plane and a positive integer k, find a Steiner tree with at most k Steiner points such that the length of the longest edges in the tree is minimized. The problem has applications in the design of wireless communication networks. We give a ratio-1.866 approximation algorithm for the problem.