Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
A faster approximation algorithm for the Steiner problem in graphs
Information Processing Letters
Delaunay graphs are almost as good as complete graphs
Discrete & Computational Geometry
Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
Classes of graphs which approximate the complete Euclidean graph
Discrete & Computational Geometry
Surpassing the information theoretic bound with fusion trees
Journal of Computer and System Sciences - Special issue: papers from the 22nd ACM symposium on the theory of computing, May 14–16, 1990
Recent results on the single-source shortest paths problem
ACM SIGACT News
Faster shortest-path algorithms for planar graphs
Journal of Computer and System Sciences - Special issue: 26th annual ACM symposium on the theory of computing & STOC'94, May 23–25, 1994, and second annual Europe an conference on computational learning theory (EuroCOLT'95), March 13–15, 1995
Modelling extremal events: for insurance and finance
Modelling extremal events: for insurance and finance
Undirected single-source shortest paths with positive integer weights in linear time
Journal of the ACM (JACM)
A 3-approximation algorithm for the k-level uncapacitated facility location problem
Information Processing Letters
Floats, integers, and single source shortest paths
Journal of Algorithms
SIAM Journal on Computing
The DBLP Computer Science Bibliography: Evolution, Research Issues, Perspectives
SPIRE 2002 Proceedings of the 9th International Symposium on String Processing and Information Retrieval
Priority Queues: Small, Monotone and Trans-dichotomous
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
Local Search Heuristics for k-Median and Facility Location Problems
SIAM Journal on Computing
$(1 + \epsilon,\beta)$-Spanner Constructions for General Graphs
SIAM Journal on Computing
Journal of Computer and System Sciences - Special issue: STOC 2003
Compact oracles for reachability and approximate distances in planar digraphs
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Computing the shortest path: A search meets graph theory
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Improved approximation for universal facility location
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Faster Algorithms for Approximate Distance Oracles and All-Pairs Small Stretch Paths
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Voronoi diagrams in n · 2o(√lg lg n) time
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
More algorithms for all-pairs shortest paths in weighted graphs
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Engineering highway hierarchies
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Equivalence between priority queues and sorting
Journal of the ACM (JACM)
Lower-bounded facility location
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Studying (non-planar) road networks through an algorithmic lens
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Engineering fast route planning algorithms
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Landmark-based routing in dynamic graphs
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Combining hierarchical and goal-directed speed-up techniques for Dijkstra's algorithm
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Contraction hierarchies: faster and simpler hierarchical routing in road networks
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Shortest-path queries for complex networks: exploiting low tree-width outside the core
Proceedings of the 15th International Conference on Extending Database Technology
Shortest-path queries in static networks
ACM Computing Surveys (CSUR)
Hi-index | 0.00 |
We propose an approximation method to answer point-to-point shortest path queries in undirected edge-weighted graphs, based on random sampling and Voronoi duals. We compute a simplification of the graph by selecting nodes independently at random with probability p. Edges are generated as the Voronoi dual of the original graph, using the selected nodes as Voronoi sites. This overlay graph allows for fast computation of approximate shortest paths for general, undirected graphs. The time-quality tradeoff decision can be made at query time. We provide bounds on the approximation ratio of the path lengths as well as experimental results. The theoretical worst-case approximation ratio is bounded by a logarithmic factor. Experiments show that our approximation method based on Voronoi duals has extremely fast preprocessing time and efficiently computes reasonably short paths.