Fast, precise and dynamic distance queries

zbMATH Open1373.68188arXiv1008.1480MaRDI QIDQ5365085FDOQ5365085

Authors: Tsvi Kopelowitz, Liam Roditty, Yair Bartal, Lee-Ad Gottlieb, Moshe Lewenstein 

Publication date: 29 September 2017

Full work available at URL: https://arxiv.org/abs/1008.1480

Recommendations

• Searching dynamic point sets in spaces with bounded doubling dimension
• scientific article; zbMATH DE number 2149349
• scientific article; zbMATH DE number 2038782
• Approximate distance oracles with constant query time
• Approximate distance oracles for geometric spanners

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Searching and sorting (68P10)

Cited In (12)

• Searching dynamic point sets in spaces with bounded doubling dimension
• An axiomatic approach to time-dependent shortest path oracles
• Title not available (Why is that?)
• Linear-space approximate distance oracles for planar, bounded-genus and minor-free graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Preprocess, set, query!
• Shortest-path queries in static networks
• Tie-breaking strategies for fast distance join processing
• Fast approximation in subspaces by doubling metric decomposition
• An efficient sum query algorithm for distance-based locally dominating functions
• Dynamic data structures for approximate Hausdorff distance in the word RAM

This page was built for publication: Fast, precise and dynamic distance queries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5365085)