On Exact Solutions to the Euclidean Bottleneck Steiner Tree Problem
From MaRDI portal
Publication:3605490
Recommendations
- On exact solutions to the Euclidean bottleneck Steiner tree problem
- Exact algorithms for the bottleneck Steiner tree problem
- Exact algorithms for the bottleneck Steiner tree problem (extended abstract)
- An approximation algorithm for a bottleneck \(k\)-Steiner tree problem in the Euclidean plane
- An optimal algorithm for the Euclidean bottleneck full Steiner tree problem
Cites work
- scientific article; zbMATH DE number 3919830 (Why is no real title available?)
- An approximation algorithm for a bottleneck \(k\)-Steiner tree problem in the Euclidean plane
- Approximations for a bottleneck Steiner tree problem
- Optimal and approximate bottleneck Steiner trees
- The upper envelope of Voronoi surfaces and its applications
- Voronoi diagram for services neighboring a highway
Cited in
(7)- Exact solutions for the Steiner path cover problem on special graph classes
- The Euclidean bottleneck Steiner path problem and other applications of \((\alpha ,\beta )\)-pair decomposition
- An exact algorithm for the Euclidean \(k\)-Steiner tree problem
- Exact algorithms for the bottleneck Steiner tree problem (extended abstract)
- On exact solutions to the Euclidean bottleneck Steiner tree problem
- An optimal algorithm for the Euclidean bottleneck full Steiner tree problem
- Exact algorithms for the bottleneck Steiner tree problem
This page was built for publication: On Exact Solutions to the Euclidean Bottleneck Steiner Tree Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3605490)