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
An approximation algorithm for a bottleneck k-Steiner tree problem in the Euclidean plane
Information Processing Letters
Approximations for Steiner Trees with Minimum Number of Steiner Points
Journal of Global Optimization
Minimizing the Number of Optical Amplifiers Needed to Support a Multi-Wavelength Optical LAN/MAN
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Approximating survivable networks with minimum number of Steiner points
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Energy-efficient roadside unit scheduling for maintaining connectivity in vehicle ad-hoc network
Proceedings of the 5th International Conference on Ubiquitous Information Management and Communication
Fault-tolerant relay node placement in wireless sensor networks
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Research on the fault tolerance deployment in sensor networks
GCC'05 Proceedings of the 4th international conference on Grid and Cooperative Computing
A Survey of Parallel and Distributed Algorithms for the Steiner Tree Problem
International Journal of Parallel Programming
| Hi-index | 0.00 |
We study variations of Steiner tree problem. Let P = {p1, p2, . . ., pn} be a set of n terminals in the Euclidean plane. For a positive integer k, the bottleneck Steiner tree problem (BSTP for short) is to find a Steiner tree with at most k Steiner points such that the length of the longest edges in the tree is minimized. For a positive constant R, the Steiner tree problem with minimum number of Steiner points (STP - MSP for short) asks for a Steiner tree such that each edge in the tree has length at most R and the number of Steiner points is minimized. In this paper, we give (1) a ratio-√3 + Ɛ approximation algorithm for BSTP, where Ɛ is an arbitrary positive number; (2) a ratio-3 approximation algorithm for STP-MSP with running time O(n3); (3) a ratio-5/2 approximation algorithm for STP-MSP.