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)
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
[Article contains additional citations not shown here]
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