Finding the best shortcut in a geometric network
From MaRDI portal
Publication:5370629
DOI10.1145/1064092.1064143zbMath1387.05065MaRDI QIDQ5370629
Panos Giannopoulos, Mohammad Farshi, Joachim Gudmundsson
Publication date: 20 October 2017
Published in: Proceedings of the twenty-first annual symposium on Computational geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1064092.1064143
68Q25: Analysis of algorithms and problem complexity
05C12: Distance in graphs
05C85: Graph algorithms (graph-theoretic aspects)
68W25: Approximation algorithms