Bottleneck Steiner trees in the plane

DOI10.1109/12.127452zbMath1395.68219MaRDI QIDQ5375342

No author found.

Publication date: 14 September 2018

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/12.127452

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

05C05: Trees

68R10: Graph theory (including graph drawing) in computer science

05C85: Graph algorithms (graph-theoretic aspects)

Related Items

Fixed parameter tractability of a biconnected bottleneck Steiner network problem, Steiner tree problem with minimum number of Steiner points and bounded edge-length, The bottleneck 2-connected \(k\)-Steiner network problem for \(k \leq 2\), On exact solutions to the Euclidean bottleneck Steiner tree problem, An exact algorithm for the bottleneck 2-connected \(k\)-Steiner network problem in \(L_p\) planes, Optimal and approximate bottleneck Steiner trees, An approximation algorithm for a bottleneck \(k\)-Steiner tree problem in the Euclidean plane, A note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points, Approximation algorithms for constructing required subgraphs using stock pieces of fixed length, Bottleneck Steiner tree with bounded number of Steiner vertices, The Euclidean bottleneck full Steiner tree problem, Degree bounded bottleneck spanning trees in three dimensions, Monochromatic geometric \(k\)-factors for bicolored point sets with auxiliary points, Approximating minimum Steiner point trees in Minkowski planes