Bottleneck Steiner trees in the plane

DOI10.1109/12.127452zbMath1395.68219OpenAlexW2161071733MaRDI 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

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

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