On exact solutions to the Euclidean bottleneck Steiner tree problem
From MaRDI portal
Publication:765514
DOI10.1016/j.ipl.2010.05.014zbMath1234.68126OpenAlexW2073061830MaRDI QIDQ765514
Sang Won Bae, Chunseok Lee, Sung Hee Choi
Publication date: 19 March 2012
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2010.05.014
Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (8)
The bottleneck 2-connected \(k\)-Steiner network problem for \(k \leq 2\) ⋮ An exact algorithm for the bottleneck 2-connected \(k\)-Steiner network problem in \(L_p\) planes ⋮ 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 ⋮ Generalised \(k\)-Steiner tree problems in normed planes ⋮ The Euclidean bottleneck full Steiner tree problem ⋮ On the restricted \(k\)-Steiner tree problem
Cites Work
- Unnamed Item
- Unnamed Item
- Voronoi diagram for services neighboring a highway
- The upper envelope of Voronoi surfaces and its applications
- Approximations for a bottleneck Steiner tree problem
- Optimal and approximate bottleneck Steiner trees
- An approximation algorithm for a bottleneck \(k\)-Steiner tree problem in the Euclidean plane
- On two geometric problems related to the travelling salesman problem
- On Exact Solutions to the Euclidean Bottleneck Steiner Tree Problem
- Exact Algorithms for the Bottleneck Steiner Tree Problem
- Bottleneck Steiner trees in the plane
This page was built for publication: On exact solutions to the Euclidean bottleneck Steiner tree problem
