Approximate distance oracles for geometric spanners

DOI10.1145/1328911.1328921zbMath1445.68068OpenAlexW2052373622MaRDI QIDQ4962702

Giri Narasimhan, Joachim Gudmundsson, Christos Levcopoulos, Michiel H. M. Smid

Publication date: 5 November 2018

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

approximation algorithmgeometric graphsshortest pathscomputational geometryspanners

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05) Approximation algorithms (68W25)

Related Items (8)

Euclidean Steiner Spanners: Light and Sparse ⋮ Truly Optimal Euclidean Spanners ⋮ Online Spanners in Metric Spaces ⋮ Light Euclidean Spanners with Steiner Points ⋮ Reachability problems for transmission graphs ⋮ Shortest-Path Queries in Geometric Networks ⋮ Reachability problems for transmission graphs ⋮ Graph spanners: a tutorial review

This page was built for publication: Approximate distance oracles for geometric spanners