Mikkel Thorup, Uri Zwick  Home/Search
Context Related
| cs.tau.ac.il/%7Ezw...eJACMrevision.ps 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: math.tau.ac.il/~z...onlinepapers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Let G = (V, E) be an undirected weighted graph with = n and 1 be an integer. We show that G = (V, E) can be preprocessed in O(kmn ) expected time, constructing a data structure of size O(kn ), such that any subsequent distance query can be answered, approximately, in O(k) time. (Update)
Similar documents based on text: More All
0.5: Approximate Distance Oracles - Mikkel Thorup Uri (2001) (Correct)
0.2: Roundtrip Spanners and Roundtrip Routing in Directed Graphs - Roditty, Thorup, Zwick (Correct)
0.2: Melding Priority Queues - Mendelson, Tarjan, Thorup, Zwick (2004) (Correct)
Related documents from co-citation: More All
21: Compact routing schemes - Thorup, Zwick - 2001
21: Compact routing with minimum stretch - Cowen
18: Routing in distributed networks: Overview and open problems - Gavoille - 2001
BibTeX entry: (Update)
Mikkel Thorup and Uri Zwick. Approximate distance oracles. In 33 rd Annual ACM Symposium on Theory of Computing (STOC), pages 183-192, Hersonissos, Crete, Greece, July 2001. http://citeseer.ist.psu.edu/thorup01approximate.html More
@inproceedings{ thorup01approximate,
author = "Mikkel Thorup and Uri Zwick",
title = "Approximate distance oracles",
booktitle = "{ACM} Symposium on Theory of Computing",
pages = "183-192",
year = "2001",
url = "citeseer.ist.psu.edu/thorup01approximate.html" }
Citations (may not include all citations):3972 Introduction to algorithms (context) - Cormen, Leiserson et al. - 2001
957 The probabilistic method (context) - Alon, Spencer - 1992
837 Cambridge University Press (context) - Motwani, Raghavan - 1995
358 Universal classes of hash functions (context) - Carter, Wegman - 1979
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
170 The geometry of graphs and some of its algorithmic applicati.. - Linial, London et al. - 1995
148 Storing a sparse table with O (context) - Fredman, Komlos et al. - 1984
148 Ramanujan graphs (context) - Lubotzky, Phillips et al. - 1988
109 the shortest spanning subtree of a graph and the traveling s.. (context) - Kruskal - 1956
74 Extremal graph theory (context) - Bollobas - 1978
68 Explicit group--theoretical construction of combinatorial sc.. (context) - Margulis - 1988
64 Routing with polynomial communication-space trade-o - Awerbuch, Peleg - 1992
59 External memory algorithms and data structures: Dealing with.. - Vitter - 2001
51 On sparse spanners of weighted graphs (context) - Althofer, Das et al. - 1993
44 Compact routing schemes - Thorup, Zwick - 2001
37 A reliable randomized algorithm for the closest-pair problem (context) - Dietzfelbinger, Hagerup et al. - 1997
37 Journal of Graph Theory (context) - Peleg, Scha et al. - 1989
34 Distance labeling in graphs - Gavoille, Peleg et al. - 2001
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
28 Fast estimation of diameter and shortest paths (context) - Aingworth, Chekuri et al. - 1999
28 Sublinear time algorithms for metric space problems - Indyk - 1999
27 Fast algorithms for constructing t-spanners and paths with s.. (context) - Cohen - 1999
24 Distributed computing -- A locality-sensitive approach (context) - Peleg - 2000
24 Cycles of even length in graphs (context) - Bondy, Simonovits - 1974
20 Minimal regular graphs of girth eight and twelve (context) - Benson - 1966
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 Compact oracles for reachability and approximate distances i.. (context) - Thorup - 2001
17 a problem of graph theory (context) - Erdos, Renyi et al. - 1966
17 A tight bound on approximating arbitrary metrics by tree met.. - Fakcharoenphol, Rao et al. - 2003
17 All-pairs small-stretch paths - Cohen, Zwick - 2001
16 All pairs shortest paths in undirected graphs with integer w.. - Shoshan, Zwick - 1999
15 A new series of dense graphs of high girth (context) - Lazebnik, Ustimenko et al. - 1995
14 Proximity-preserving labeling schemes (context) - Peleg - 2000
13 Uber ein Problem von K (context) - Reiman - 1958
13 On graphs that do not contain a Thomsen graph (context) - Brown - 1966
13 All-pairs shortest paths and the essential subgraph (context) - McGeoch - 1995
12 Sur la trialite et certains groupes qui s'en deduisent (context) - Tits - 1959
12 Even strongly universal hashing is pretty fast (context) - Thorup - 2000
10 The Moore bound for irregular graphs - Alon, Hoory et al. - 2002
9 A characterization of the components of the graphs D (context) - Lazebnik, Ustimenko et al. - 1996
9 volume 212 of Graduate Texts in Mathematics (context) - Matousek, discrete - 2002
8 Extremal problems in graph theory (context) - Erdos - 1964
8 Extremal graphs with no C (context) - Wenger
7 On approximating arbitrary metrices by tree metrics (context) - Bartal - 1999
7 and single source shortest paths (context) - Thorup, integers - 2000
6 Spanner constructions for general graphs (context) - Elkin, Peleg - 2001
6 Shortest paths in digraphs of small treewidth (context) - Chaudhuri, Zaroliagis - 2000
5 the distortion required for embedding finite metric spaces i.. (context) - Matousek - 1996
5 Unpublished result (context) - Halperin, Zwick - 1996
4 witnesses for boolean matrix multiplication (context) - Alon, Naor - 1996
4 A simple linear time algorithm for computing (context) - Baswana, Sen - 2003
4 New examples of graphs without small cycles and of large siz.. (context) - Lazebnik, Ustimenko - 1991
3 Preprocessing an undirected planar network to enable fast ap.. (context) - Klein - 2002
3 On Libschitz embedding of finite metric spaces in hilbert sp.. (context) - Bourgain - 1985
2 Computing almost shortest paths (context) - Elkin - 2001
2 Approximate distance oracles for unweighted graphs in O (context) - Baswana, Sen - 2004
2 A dictionary implementaion based on dynamic perfect hashing (context) - Dietzfelbinger, Hune - 1996
1 Approximate distance oracles revisited (context) - Gudmundson, Levcopoulos et al. - 2002
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.math.tau.ac.il/~zwick/online-papers.html): More
All-Pairs Small-Stretch Paths - Cohen, Zwick (1997) (Correct)
The Memory Game - Zwick, Paterson (Correct)
All Pairs Almost Shortest Paths - Dor, Halperin, Zwick (1997) (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