Exact and Approximate Distances in Graphs - A Survey

Authors:
Uri Zwick
Affiliations:
-
Venue:
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Year:
2001

Citing 59
Cited 33

Complexity of network synchronization

Journal of the ACM (JACM)
Scaling algorithms for network problems

Journal of Computer and System Sciences
Fibonacci heaps and their uses in improved network optimization algorithms

Journal of the ACM (JACM)
Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation

Communications of the ACM
Faster scaling algorithms for network problems

SIAM Journal on Computing
Faster algorithms for the shortest path problem

Journal of the ACM (JACM)
Matrix multiplication via arithmetic progressions

Journal of Symbolic Computation - Special issue on computational algebraic complexity
Introduction to algorithms

Introduction to algorithms
A new upper bound on the complexity of the all pairs shortest path problem

Information Processing Letters
On sparse spanners of weighted graphs

Discrete & Computational Geometry
Witnesses for Boolean matrix multiplication and for transitive closure

Journal of Complexity
Finding the hidden path: time bounds for all-pairs shortest paths

SIAM Journal on Computing
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
Trans-dichotomous algorithms for minimum spanning trees and shortest paths

Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
Generating sparse 2-spanners

Journal of Algorithms
Scaling Algorithms for the Shortest Paths Problem

SIAM Journal on Computing
On the all-pairs-shortest-path problem in unweighted undirected graphs

Journal of Computer and System Sciences - Special issue on selected papers presented at the 24th annual ACM symposium on the theory of computing (STOC '92)
Shortest paths algorithms: theory and experimental evaluation

Mathematical Programming: Series A and B
Using selective path-doubling for parallel shortest-path computations

Journal of Algorithms
All pairs shortest paths for graphs with small integer length edges

Journal of Computer and System Sciences - Special issue: papers from the 32nd and 34th annual symposia on foundations of computer science, Oct. 2–4, 1991 and Nov. 3–5, 1993
On the exponent of the all pairs shortest path problem

Journal of Computer and System Sciences - Special issue: papers from the 32nd and 34th annual symposia on foundations of computer science, Oct. 2–4, 1991 and Nov. 3–5, 1993
All pairs shortest distances for graphs with small integer length edges

Information and Computation
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
A randomized parallel algorithm for single-source shortest paths

Journal of Algorithms
Rectangular matrix multiplication revisited

Journal of Complexity
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
Near-Linear Time Construction of Sparse Neighborhood Covers

SIAM Journal on Computing
Fast rectangular matrix multiplication and applications

Journal of Complexity
All pairs lightest shortest paths

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)

SIAM Journal on Computing
Buckets, Heaps, Lists, and Monotone Priority Queues

SIAM Journal on Computing
Faster deterministic sorting and priority queues in linear space

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Undirected single-source shortest paths with positive integer weights in linear time

Journal of the ACM (JACM)
Efficient Algorithms for Shortest Paths in Sparse Networks

Journal of the ACM (JACM)
Polylog-time and near-linear work approximation scheme for undirected shortest paths

Journal of the ACM (JACM)
Floats, integers, and single source shortest paths

Journal of Algorithms
All-Pairs Almost Shortest Paths

SIAM Journal on Computing
Distributed computing: a locality-sensitive approach

Distributed computing: a locality-sensitive approach
Improved fast integer sorting in linear space

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Compact routing with minimum stretch

Journal of Algorithms
All-pairs small-stretch paths

Journal of Algorithms
Compact routing schemes

Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
(1 + &egr;&Bgr;)-spanner constructions for general graphs

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Approximate distance oracles

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
On RAM Priority Queues

SIAM Journal on Computing
Approximating k-Spanner Problems for k2

Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
Improved Shortest Paths on the Word RAM

ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Sorting and Searching on the Word RAM

STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
Priority Queues: Small, Monotone and Trans-dichotomous

ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
All Pairs Shortest Paths in weighted directed graphs ? exact and almost exact algorithms

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
All Pairs Shortest Paths in Undirected Graphs with Integer Weights

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Fully Dynamic Algorithms for Maintaining All-Pairs Shortest Paths and Transitive Closure in Digraphs

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Fully dynamic transitive closure: breaking through the O(n/sup 2/) barrier

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Lower bounds for algebraic computation trees

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Computing Almost Shortest Paths,

Computing Almost Shortest Paths,
Witnesses for Boolean matrix multiplication and for shortest paths

SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science

A Faster All-Pairs Shortest Path Algorithm for Real-Weighted Sparse Graphs

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
On the Comparison-Addition Complexity of All-Pairs Shortest Paths

ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
On the Power of BFS to Determine a Graphs Diameter

LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Experimental Evaluation of a New Shortest Path Algorithm

ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
A Geometric Approach to Boolean Matrix Multiplication

ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Transitive-closure spanners

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Approximating Shortest Paths in Graphs

WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Solving path problems on the GPU

Parallel Computing
Fast and accurate estimation of shortest paths in large graphs

CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Finding the diameter in real-world graphs experimentally turning a lower bound into an upper bound

ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Distance distribution and average shortest path length estimation in real-world networks

ADMA'10 Proceedings of the 6th international conference on Advanced data mining and applications: Part I
SPRINT: ranking search results by paths

Proceedings of the 14th International Conference on Extending Database Technology
Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs

SIAM Journal on Computing
New bounds for old algorithms: on the average-case behavior of classic single-source shortest-paths approaches

TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
Indexing Network Structure with Shortest-Path Trees

ACM Transactions on Knowledge Discovery from Data (TKDD)
Fast fully dynamic landmark-based estimation of shortest path distances in very large graphs

Proceedings of the 20th ACM international conference on Information and knowledge management
A low cost and effective link protection approach for enhanced survivability in optical transport networks

ISPA'06 Proceedings of the 2006 international conference on Frontiers of High Performance Computing and Networking
Approximate shortest paths in weighted graphs

Journal of Computer and System Sciences
All-pairs nearly 2-approximate shortest-paths in O(n2 polylog n) time

STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Soundness of resource-constrained workflow nets

ICATPN'05 Proceedings of the 26th international conference on Applications and Theory of Petri Nets
A slightly improved sub-cubic algorithm for the all pairs shortest paths problem with real edge lengths

ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Some results on approximate 1-median selection in metric spaces

Theoretical Computer Science
Approximating average parameters of graphs

APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Approximate distance queries in disk graphs

WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Partitioned multi-indexing: bringing order to social search

Proceedings of the 21st international conference on World Wide Web
A combinatorial algorithm for all-pairs shortest paths in directed vertex-weighted graphs with applications to disc graphs

SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Performance guarantees for distributed reachability queries

Proceedings of the VLDB Endowment
Faster approximation of distances in graphs

WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Approximate shortest paths guided by a small index

WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Fast routing table construction using small messages: extended abstract

Proceedings of the forty-fifth annual ACM symposium on Theory of computing
A group based approach for path queries in road networks

SSTD'13 Proceedings of the 13th international conference on Advances in Spatial and Temporal Databases
Shortest-path queries in static networks

ACM Computing Surveys (CSUR)
On computing the diameter of real-world undirected graphs

Theoretical Computer Science

Quantified Score

Hi-index	0.01

Visualization

Abstract

We survey recent and not so recent results related to the computation of exact and approximate distances, and corresponding shortest, or almost shortest, paths in graphs. We consider many different settings and models and try to identify some remaining open problems.