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

Information Processing Letters

Volumn 81, Issue 3, 2002, Pages 151-156

  Wang, Lusheng ^a   Li, Zimao ^a  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Algorithmical approximation; Algorithms; Steiner trees

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING; WIRELESS TELECOMMUNICATION SYSTEMS;

STEINER TREES;

TREES (MATHEMATICS);

EID: 0037074664     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(01)00209-5     Document Type: Article

References (7)

1. Approximations for Steiner trees with minimum number of Steiner points
2. A powerful global router: Based on Steiner min-max tree
3. Steiner tree problem with minimum number of Steiner points and bounded edge-length
4. A note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points
5. A new approximation algorithm for the Steiner tree problem with performance ratio 5/3
6. Bottleneck Steiner trees in the plane
7. Approximations for a bottleneck Steiner tree problem