Approximate distance oracles for geometric graphs

Authors:
Joachim Gudmundsson;Christos Levcopoulos;Giri Narasimhan;Michiel Smid
Affiliations:
Utrecht University, Utrecht, the Netherlands;Lund University, Lund, Sweden;Florida International University, Miami, FL;Carleton University, Ottawa, Ontario, Canada
Venue:
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Year:
2002

Citing 19
Cited 25

Fast algorithms for finding nearest common ancestors

SIAM Journal on Computing
Approximation algorithms for shortest path motion planning

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
On finding lowest common ancestors: simplification and parallelization

SIAM Journal on Computing
Classes of graphs which approximate the complete Euclidean graph

Discrete & Computational Geometry
A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields

Journal of the ACM (JACM)
Range searching and point location among fat objects

Journal of Algorithms
Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
Realistic input models for geometric algorithms

SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Shortest paths and networks

Handbook of discrete and computational geometry
Fast Algorithms for Constructing t-Spanners and Paths with Stretch t

SIAM Journal on Computing
Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)

SIAM Journal on Computing
On the all-pairs Euclidean short path problem

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Two-point Euclidean shortest path queries in the plane

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Shortest Path Queries Among Weighted Obstacles in the Rectilinear Plane

SIAM Journal on Computing
All-Pairs Almost Shortest Paths

SIAM Journal on Computing
Approximate distance oracles

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Approximating the Stretch Factor of Euclidean Graphs

SIAM Journal on Computing
The LCA Problem Revisited

LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane

ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms

Approximation algorithms for the bottleneck stretch factor problem

Nordic Journal of Computing
Approximate Distance Oracles Revisited

ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Well-separated pair decomposition for the unit-disk graph metric and its applications

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Deformable spanners and applications

SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Bypassing the embedding: algorithms for low dimensional metrics

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Fast construction of nets in low dimensional metrics, and their applications

SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Deformable spanners and applications

Computational Geometry: Theory and Applications
Approximate distance oracles for graphs with dense clusters

Computational Geometry: Theory and Applications
Spanners with slack

ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Approximate distance oracles for geometric spanners

ACM Transactions on Algorithms (TALG)
Geometric spanners with small chromatic number

Computational Geometry: Theory and Applications
Experimental study of geometric t-spanners

Journal of Experimental Algorithmics (JEA)
Deformable spanners and applications

Computational Geometry: Theory and Applications
Compact oracles for approximate distances around obstacles in the plane

ESA'07 Proceedings of the 15th annual European conference on Algorithms
Geometric spanners with small chromatic number

WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies

Journal of Discrete Algorithms
Balancing degree, diameter and weight in Euclidean spanners

ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
On spanners of geometric graphs

SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
I/O-Efficiently pruning dense spanners

JCDCG'04 Proceedings of the 2004 Japanese conference on Discrete and Computational Geometry
Experimental study of geometric t-spanners

ESA'05 Proceedings of the 13th annual European conference on Algorithms
An optimal-time construction of sparse Euclidean spanners with tiny diameter

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Fast pruning of geometric spanners

STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Approximate distance oracles for graphs with dense clusters

ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
The emergence of sparse spanners and greedy well-separated pair decomposition

SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Sparse Euclidean Spanners with Tiny Diameter

ACM Transactions on Algorithms (TALG) - Special Issue on SODA'11

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given a geometric t-spanner graph G in Ed with n points and m edges, with edge lengths that lie within a polynomial (in n) factor of each other. Then, after O(m+n log n) preprocessing, we present an approximation scheme to answer (1+ε)-approximate shortest path queries in O(1) time. The data structure uses O(n log n) space.