Uri Zwick  Home/Search
Context Related
| cs.tau.ac.il/%7Ezw...tsurveyesa.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.tau.ac.il/~z...yonlinepapers (more) Homepages: U.Zwick |
Rate this article:      (best)Comment on this article |
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. (Update)
Context of citations to this paper: More
.... best implementable algorithm is due to Takaoka [Tak92] running in time O(n 3 p log log n= log n) We refer the reader to Zwick s survey [Z01] for a summary of other shortest path algorithms. It is still an open question whether there are O(n ) o(mn) algorithms for APSP when...
...as though the component hierarchy approach used in [16] and [17] also required integers. We refer the reader to a recent survey paper [18] for more background and references. The state of the art in all pairs shortest paths (APSP) for real weighted, sparse, directed graphs...
Cited by: More
Combining Speed-Up Techniques for Shortest-Path Computations - Holzer, Schulz, Willhalm (2004) (Correct)
Well-Separated Pair Decomposition for the Unit-Disk Graph.. - Gao, Zhang (2003) (Correct)
A New Approach to All-Pairs Shortest Paths on Real-Weighted Graphs - Pettie (2003) (Correct)
Active bibliography (related documents): More All
1.7: All Pairs Shortest Paths using Bridging Sets and Rectangular.. - Zwick (2000) (Correct)
1.3: Approximate Distance Oracles - Thorup, Zwick (2001) (Correct)
0.9: All Pairs Shortest Paths in weighted directed graphs - exact and.. - Zwick (1998) (Correct)
Similar documents based on text: More All
0.3: Compact Routing Schemes - Thorup, Zwick (2001) (Correct)
0.3: Constructing Worst Case Instances for Semidefinite.. - Alon, Sudakov, Zwick (2001) (Correct)
0.2: Median Selection Requires (2+ε)n Comparisons - Dor, Zwick (1996) (Correct)
Related documents from co-citation: More All
7: A note on two problems in connexion with graphs (context) - Dijkstra - 1959
7: Fibonacci heaps and their uses in improved network optimization algorithms (context) - Fredman, Tarjan - 1987
6: Undirected single-source shortest path with positive integer weights in linear t.. - Thorup - 1999
BibTeX entry: (Update)
U. Zwick. Exact and approximate distances in graphs { a survey. In Proc. 9th ESA (2001), 33-48. Updated copy at http://www.cs.tau.ac.il/~zwick http://citeseer.ist.psu.edu/zwick01exact.html More
@article{ zwick01exact,
author = "Uri Zwick",
title = "Exact and Approximate Distances in Graphs --- {A} Survey",
journal = "Lecture Notes in Computer Science",
volume = "2161",
pages = "33+",
year = "2001",
url = "citeseer.ist.psu.edu/zwick01exact.html" }
Citations (may not include all citations):3972 Introduction to algorithms (context) - Cormen, Leiserson et al. - 1990
1450 The design and analysis of computer algorithms (context) - Aho, Hopcroft et al. - 1974
354 A note on two problems in connexion with graphs (context) - Dijkstra - 1959
353 Fibonacci heaps and their uses in improved network optimizat.. (context) - Fredman, Tarjan - 1987
308 Matrix multiplication via arithmetic progressions (context) - Coppersmith, Winograd - 1990
168 Gaussian elimination is not optimal (context) - Strassen - 1969
117 Complexity of network synchronization (context) - Awerbuch - 1985
109 the shortest spanning subtree of a graph and the traveling s.. (context) - Kruskal - 1956
102 A characterization of the minimum cycle mean in a digraph (context) - Karp - 1978
97 Shortest paths algorithms: theory and experimental evaluatio.. - Cherkassky, Goldberg et al. - 1996
97 Trans-dichotomous algorithms for minimum spanning trees and .. (context) - Fredman, Willard - 1994
69 Surpassing the information-theoretic bound with fusion trees (context) - Fredman, Willard - 1993
63 Faster algorithms for the shortest path problem (context) - Ahuja, Mehlhorn et al. - 1990
61 Faster scaling algorithms for network problems (context) - Gabow, Tarjan - 1989
54 On RAM priority queues - Thorup - 2000
53 Relaxed heaps: an alternative to Fibonacci heaps with applic.. (context) - Driscoll, Gabow et al. - 1988
49 Geometric shortest paths and network optimization - Mitchell - 2000
48 Spanning trees and spanners - Eppstein - 2000
48 the exponent of the all pairs shortest path problem (context) - Alon, Galil et al. - 1997
44 Compact routing schemes - Thorup, Zwick - 2001
43 Approximate distance oracles - Thorup, Zwick - 2001
42 Compact routing with minimum stretch - Cowen - 2001
37 Journal of Graph Theory (context) - Peleg, Sch et al. - 1989
37 New bounds on the complexity of the shortest path problem (context) - Fredman - 1976
33 Finding the hidden path: time bounds for all-pairs shortest .. - Karger, Koller et al. - 1993
32 Undirected single-source shortest paths with positive intege.. - Thorup - 1999
30 Lower bounds for algebraic computation trees (context) - Ben-Or - 1983
29 Design and implementation of an ecient priority queue (context) - Boas, Kaas et al. - 1977
29 A new upper bound on the complexity of the all pairs shortes.. (context) - Takaoka - 1992
28 Fast estimation of diameter and shortest paths (context) - Aingworth, Chekuri et al. - 1999
27 Shortest paths and networks (context) - Mitchell - 1997
27 Fast algorithms for constructing t-spanners and paths with s.. (context) - Cohen - 1999
26 Schnelle multiplikation grosser zahlen (context) - Sch, Strassen - 1971
26 Scaling algorithms for the shortest paths problem (context) - Goldberg - 1995
26 witnesses for Boolean matrix multiplication and construction.. (context) - Alon, Naor - 1996
24 Scaling algorithms for network problems (context) - Gabow - 1985
23 the all-pairs-shortest-path problem in unweighted undirected.. (context) - Seidel - 1995
22 Sorting and searching on the word RAM (context) - Hagerup - 1998
22 Improved shortest paths on the word RAM (context) - Hagerup - 2000
21 Fully dynamic algorithms for maintaining all-pairs shortest .. - King - 1999
20 and monotone priority queues (context) - Cherkassky, Goldberg et al. - 1999
19 All pairs almost shortest paths - Dor, Halperin et al. - 2000
19 Near-linear time construction of sparse neighborhood covers (context) - Awerbuch, Berger et al. - 1999
18 Faster shortest-path algorithms for planar graphs - Henzinger, Klein et al. - 1997
18 monotone and trans-dichotomous (context) - Raman, small - 1996
18 Compact oracles for reachability and approximate distances i.. (context) - Thorup - 2001
18 Fully dynamic transitive closure: breaking through the O - Demetrescu, Italiano - 2000
18 Fast rectangular matrix multiplications and applications (context) - Huang, Pan - 1998
17 All-pairs small-stretch paths - Cohen, Zwick - 2001
17 Faster deterministic sorting and priority queues in linear s.. (context) - Thorup - 1998
16 Recent results on the single-source shortest paths problem (context) - Raman - 1997
16 All pairs shortest paths in undirected graphs with integer w.. - Shoshan, Zwick - 1999
15 Generating sparse 2-spanners (context) - Kortsarz, Peleg - 1994
15 All pairs shortest paths for graphs with small integer lengt.. (context) - Galil, Margalit - 1997
15 On sparse spanners of weighted graphs (context) - Alth, Das et al. - 1993
15 Preserving order in a forest in less than logarithmic time a.. (context) - Boas - 1977
14 Polylog-time and near-linear work approximation scheme for u.. (context) - Cohen - 2000
14 Computing shortest paths with comparisons and additions - Pettie, Ramachandran - 2001
14 Witnesses for boolean matrix multiplication and for shortest.. (context) - Alon, Galil et al. - 1992
13 All-pairs shortest paths and the essential subgraph (context) - McGeoch - 1995
13 Subcubic cost algorithms for the all pairs shortest path pro.. - Takaoka - 1998
13 Rectangular matrix multiplication revisited (context) - Coppersmith - 1997
11 All pairs shortest distances for graphs with small integer l.. (context) - Galil, Margalit - 1997
7 and single source shortest paths (context) - Thorup, integers - 2000
6 Witnesses for boolean matrix multiplication (context) - Galil, Margalit - 1993
6 Spanner constructions for general graphs (context) - Elkin, Peleg - 2001
5 A randomized parallel algorithm for single-source shortest p.. - Klein, Subramanian - 1997
5 Unpublished result (context) - Halperin, Zwick - 1996
4 Society for Industrial and Applied Mathematics (context) - Peleg, approach - 2000
4 Improved fast integer sorting in linear space - Han - 2001
3 The Weizmann Institute of Science (context) - Elkin, shortest et al. - 2001
3 Using selective path-doubling for parallel shortest-path com.. (context) - Cohen - 1997
2 Ecient algorithms for shortest paths in sparse graphs (context) - Johnson - 1977
2 Complexity of monotone networks for Boolean matrix product (context) - Paterson - 1975
1 spanner problems for k (context) - Elkin, Peleg - 2001
1 Monotone switching circuits and Boolean matrix product (context) - Mehlhorn, Galil - 1976
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.tau.ac.il/~zwick/my-online-papers.html): More
Which Patterns Are Hard to Find? - Cole, Hariharan, Paterson, Zwick (Correct)
Which Formulae Shrink under Random Restrictions? - Chockler, Zwick (Correct)
On the number of ANDs versus the number of ORs in monotone Boolean .. - Zwick (1996) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC