Bottleneck Steiner trees in the plane

DOI10.1109/12.127452MaRDI QIDQ5375342zbMATHOpenAlexFDO

Authors

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

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

Cited in

(15)

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

This page was built for publication: Bottleneck Steiner trees in the plane

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5375342)