Approximate Distance Oracles with Improved Query Time

DOI10.1137/1.9781611973105.39zbMath1422.68198arXiv1202.2336OpenAlexW2951886322MaRDI QIDQ5741747

Christian Wulff-Nilsen

Publication date: 15 May 2019

Published in: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Related Items (11)

Approximate distance oracles with improved stretch for sparse graphs ⋮ Prioritized Metric Structures and Embedding ⋮ Unnamed Item ⋮ Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs. ⋮ Space-efficient path-reporting approximate distance oracles ⋮ Constructing Light Spanners Deterministically in Near-Linear Time ⋮ Single-source shortest paths and strong connectivity in dynamic planar graphs ⋮ Approximate distance oracles with improved stretch for sparse graphs ⋮ Constructing light spanners deterministically in near-linear time ⋮ Unnamed Item ⋮ An axiomatic approach to time-dependent shortest path oracles

This page was built for publication: Approximate Distance Oracles with Improved Query Time