Approximate Distance Oracles with Improved Bounds

DOI10.1145/2746539.2746562zbMath1321.68216OpenAlexW2044124294MaRDI QIDQ2941481

Shiri Chechik

Publication date: 21 August 2015

Published in: Proceedings of the forty-seventh annual ACM symposium on Theory of Computing (Search for Journal in Brave)

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

zbMATH Keywords

shortest pathsdistance oraclesconstant query-time

Mathematics Subject Classification ID

Distance in graphs (05C12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05) Approximation algorithms (68W25)

Related Items (13)

A Hierarchy of Lower Bounds for Sublinear Additive Spanners ⋮ Optimal (Euclidean) Metric Compression ⋮ Prioritized Metric Structures and Embedding ⋮ Compact distance oracles with large sensitivity and low stretch ⋮ Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs. ⋮ Efficient vertex-label distance oracles for planar graphs ⋮ 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 ⋮ On notions of distortion and an almost minimum spanning tree with constant average distortion ⋮ Constructing light spanners deterministically in near-linear time ⋮ Toward Tight Approximation Bounds for Graph Diameter and Eccentricities ⋮ Unnamed Item

Uses Software

• Graphs

Cites Work

• Unnamed Item
• Ramsey partitions and proximity data structures
• On sparse spanners of weighted graphs
• Scale-oblivious metric fragmentation and the nonlinear Dvoretzky theorem
• On Approximate Distance Labels and Routing Schemes with Affine Stretch
• Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error
• Approximate distance oracles
• Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
• Near-Linear Time Construction of Sparse Neighborhood Covers
• Shortest-path queries in static networks
• Approximate distance oracles with constant query time
• Automata, Languages and Programming

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