Optimal and approximate bottleneck Steiner trees
From MaRDI portal
Publication:1362990
Recommendations
- An approximation algorithm for a bottleneck \(k\)-Steiner tree problem in the Euclidean plane
- scientific article; zbMATH DE number 1796993
- scientific article; zbMATH DE number 1424548
- On the Euclidean bottleneck full Steiner tree problem
- On Exact Solutions to the Euclidean Bottleneck Steiner Tree Problem
Cites work
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- A SHORTEST PATH APPROACH TO A MULTIFACILITY MINIMAX LOCATION PROBLEM WITH RECTILINEAR DISTANCES
- Bottleneck Steiner trees in the plane
- Combinatorial Optimization with Rational Objective Functions
- Layout of facilities with some fixed points
- On Steiner’s Problem with Rectilinear Distance
Cited in
(19)- The stochastic bottleneck linear programming problem
- Approximating the selected-internal Steiner tree
- scientific article; zbMATH DE number 7662164 (Why is no real title available?)
- scientific article; zbMATH DE number 1796993 (Why is no real title available?)
- Survivable minimum bottleneck networks
- An exact algorithm for the line-constrained bottleneck \(k\)-Steiner tree problem
- The bottleneck selected‐internal and partial terminal Steiner tree problems
- The Euclidean bottleneck Steiner path problem and other applications of \((\alpha ,\beta )\)-pair decomposition
- Approximations for a bottleneck Steiner tree problem
- A catalog of Hanan grid problems
- scientific article; zbMATH DE number 1424548 (Why is no real title available?)
- The Euclidean bottleneck Steiner path problem
- Exact algorithms for the bottleneck Steiner tree problem (extended abstract)
- On exact solutions to the Euclidean bottleneck Steiner tree problem
- Exact algorithms for the bottleneck Steiner tree problem
- Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees
- An approximation algorithm for a bottleneck \(k\)-Steiner tree problem in the Euclidean plane
- On Exact Solutions to the Euclidean Bottleneck Steiner Tree Problem
- Generalised \(k\)-Steiner tree problems in normed planes
This page was built for publication: Optimal and approximate bottleneck Steiner trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1362990)