The euclidean bottleneck steiner path problem

DOI10.1145/1998196.1998268zbMath1283.68336OpenAlexW2080608912MaRDI QIDQ5404459

Michael Segal, A. Karim Abu-Affash, Paz Carmi, 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 spannersSteiner pointsgeometric optimizationgeometric networksbottleneck pathpair decomposition

Mathematics Subject Classification ID

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

Related Items (1)

Bottleneck Steiner tree with bounded number of Steiner vertices

This page was built for publication: The euclidean bottleneck steiner path problem