Finding the best shortcut in a geometric network

DOI10.1145/1064092.1064143zbMath1387.05065OpenAlexW2048557227MaRDI QIDQ5370629

Panos Giannopoulos, Joachim Gudmundsson, Mohammad Farshi

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

zbMATH Keywords

computational geometryapproximation algorithmsgeometric networks

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (4)

Connect the Dot: Computing Feed-Links with Minimum Dilation ⋮ Almost all Delaunay triangulations have stretch factor greater than \(\pi /2\) ⋮ Testing Euclidean Spanners ⋮ Max-stretch reduction for tree spanners

This page was built for publication: Finding the best shortcut in a geometric network