The Euclidean bottleneck Steiner path problem

DOI10.1145/1998196.1998268MaRDI QIDQ5404459zbMATH OpenOpenAlexFDO

Authors A. Karim Abu-Affash, Paz Carmi, Michael Segal, Matthew J. Katz

Publication date 24 March 2014

Published in Proceedings of the twenty-seventh annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1998196.1998268

zbMATH Keywords

geometric optimizationSteiner pointsgeometric networksgeometric spannerspair decompositionbottleneck path

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial optimization (90C27) Extremal problems in graph theory (05C35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• The Euclidean bottleneck Steiner path problem and other applications of \((\alpha ,\beta )\)-pair decomposition
• The bottleneck 2-connected k-Steiner network problem for k 2
• An approximation algorithm for a bottleneck \(k\)-Steiner tree problem in the Euclidean plane
• On exact solutions to the Euclidean bottleneck Steiner tree problem
• Optimal and approximate bottleneck Steiner trees

Cited in

(4)

• Approximating geometric bottleneck shortest paths
• Bottleneck Steiner tree with bounded number of Steiner vertices
• On the Euclidean two paths problem
• The Euclidean bottleneck Steiner path problem and other applications of \((\alpha ,\beta )\)-pair decomposition

This page was built for publication: The Euclidean bottleneck Steiner path problem

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