Approximate distance oracles for geometric spanners
From MaRDI portal
Publication:4962702
DOI10.1145/1328911.1328921zbMath1445.68068MaRDI 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
68R10: Graph theory (including graph drawing) in computer science
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
68P05: Data structures
68W25: Approximation algorithms
Related Items
Euclidean Steiner Spanners: Light and Sparse, Truly Optimal Euclidean Spanners, Reachability problems for transmission graphs, Reachability problems for transmission graphs, Light Euclidean Spanners with Steiner Points, Shortest-Path Queries in Geometric Networks, Graph spanners: a tutorial review