An approximation algorithm for a bottleneck \(k\)-Steiner tree problem in the Euclidean plane
From MaRDI portal
Publication:1603516
DOI10.1016/S0020-0190(01)00209-5zbMath1032.68163OpenAlexW2148678019MaRDI QIDQ1603516
Publication date: 14 July 2002
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0020-0190(01)00209-5
Related Items
Optimal relay location for resource-limited energy-efficient wireless communication ⋮ The Euclidean bottleneck Steiner path problem and other applications of \((\alpha ,\beta )\)-pair decomposition ⋮ Exact algorithms for the bottleneck Steiner tree problem ⋮ Bottleneck Steiner tree with bounded number of Steiner vertices ⋮ The Euclidean bottleneck full Steiner tree problem ⋮ On Exact Solutions to the Euclidean Bottleneck Steiner Tree Problem ⋮ On exact solutions to the Euclidean bottleneck Steiner tree problem
Cites Work
- Steiner tree problem with minimum number of Steiner points and bounded edge-length
- Approximations for a bottleneck Steiner tree problem
- A note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points
- A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3
- Bottleneck Steiner trees in the plane
- Approximations for Steiner trees with minimum number of Steiner points
