Bottleneck Steiner Trees in the Plane
IEEE Transactions on Computers
Computing Envelopes in Four Dimensions with Applications
SIAM Journal on Computing
An approximation algorithm for a bottleneck k-Steiner tree problem in the Euclidean plane
Information Processing Letters
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
Optimal and approximate bottleneck Steiner trees
Operations Research Letters
On exact solutions to the Euclidean bottleneck Steiner tree problem
Information Processing Letters
The bottleneck 2-connected k-Steiner network problem for k≤2
Discrete Applied Mathematics
| Hi-index | 0.00 |
Given n terminals in the plane 驴2 and a positive integer k, the bottleneck Steiner tree problem is to find k Steiner points in 驴2 so that the longest edge length of the resulting Steiner tree is minimized. In this paper, we study this problem in any L p metric. We present the first fixed-parameter tractable algorithm running in O(f(k)·n 2logn) time for the L 1 and the L 驴 metrics, and the first exact algorithm for any other L p metric with 1 p O(f(k)·(n k + n logn)), where f(k) is a function dependent only on k. Note that prior to this paper there was no known exact algorithm even for the L 2 metric, and our algorithms take a polynomial time in n for fixed k.