Distance oracles for sparse graphs

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2009, Pages 703-712

  Sommer, Christian ^a   Verbin, Elad ^b   Yu, Wei ^b  

^a UNIVERSITY OF TOKYO   (Japan)

^b TSINGHUA UNIVERSITY   (China)

Author keywords

Cell probe model; Data structures; Distance oracle; Lopsided set disjointness; Lower bounds

Indexed keywords

DENSE GRAPHS; DISJOINTNESS; EFFICIENT ALGORITHM; LOPSIDED SET DISJOINTNESS; LOWER BOUNDS; PROBE-MODEL; QUERY TIME; REGULAR GRAPHS; SHORTEST DISTANCE; SPACE COMPLEXITY; SPARSE GRAPHS; SUBGRAPHS;

ALGORITHMS; COMPUTER SCIENCE; DATA STRUCTURES; FIBER OPTIC CHEMICAL SENSORS; GRAPH THEORY; PROBES;

GRAPHIC METHODS;

EID: 77952326540     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2009.27     Document Type: Conference Paper

References (32)

1. Noga Alon. Eigenvalues and expanders. Combinatorica, 6(2):83-96, 1986.
2. Noga Alon, Uriel Feige, Avi Wigderson, and David Zucker-man. Derandomized graph products. Computational Complexity, 5(1):60-75, 1995.
3. Noga Alon, Shlomo Hoory, and Nathan Linial. The Moore bound for irregular graphs. Graphs and Combinatorics, 18(1):53-57, 2002.
4. Ingo Althöfer, Gautam Das, David P. Dobkin, Deborah Joseph, and José Soares. On sparse spanners of weighted graphs. Discrete & Computational Geometry, 9:81-100, 1993.
5. Alexandr Andoni, Piotr Indyk, and Mihai Patrascu. On the optimality of the dimensionality reduction method. In 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 21-24 October 2006, Berkeley, California, USA, Proceedings, pages 449-458, 2006.
6. Surender Baswana, Akshay Gaur, Sandeep Sen, and Jayant Upadhyay. Distance oracles for unweighted graphs: Breaking the quadratic barrier with constant additive error. In Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I: Tack A: Algorithms, Automata, Complexity, and Games, pages 609-621, 2008.
7. 2) time. ACM Transactions on Algorithms, 2(4):557-577, 2006.
8. Robert Breusch. Zur Verallgemeinerung des Bertrandschen Postulates, daş zwischen x und 1x stets Primzahlen liegen. Mathematische Zeitschrift, 34(1):505-526, 1932.
9. Shiva Chaudhuri and Christos D. Zaroliagis. Shortest paths in digraphs of small treewidth. part I: Sequential algorithms. Algorithmica, 27(3):212-226, 2000. Announced at ICALP 1995.
10. Giuliana Davidoff, Peter Sarnak, and Alian Valette. Elementary Number Theory, Group Theory, and Ramanujan Graphs. Cambridge University Press, 2003.
11. Michael Elkin. Sparse graph spanners. In Encyclopedia of Algorithms. 2008.
12. Paul Erdos. Über die Primzahlen gewisser arithmetischer Reihen. Mathematische Zeitschrift, 39(1):473-491, 1935.
13. Paul Erdos. Extremal problems in graph theory. Theory of graphs and its applications, Proceedings of the Symposium in Smolenice (Prague), pages 29-36, 1964.
14. Paul Erdos and Horst Sachs. Reguläre Graphen gegebener Taillenweite mit minimaler Knotenzahl. Wissenschaftliche Zeitschrift der Martin-Luther- Universität Halle-Wittenberg. Mathematisch-Naturwissenschaftliche Reihe, pages 251-258, 1963.
15. Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, and Michiel H. M. Smid. Approximate distance oracles for geometric spanners. ACM Transactions on Algorithms, 4(1), 2008.
16. Shlomo Hoory. On graphs of high girth. PhD thesis, Hebrew University, 2002.
17. Philip N. Klein. Preprocessing an undirected planar network to enable fast approximate distance queries. In Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 6-8, 2002, San Francisco, CA, USA. ACM/SIAM, 2002, pages 820-827, 2002.
18. Philip N. Klein. Multiple-source shortest paths in planar graphs. In Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Vancouver, British Columbia, Canada, January 23-25, 2005, pages 146-155, 2005.
19. Alexander Lubotzky, Ralph Phillips, and Peter Sarnak. Ra-manujan graphs. Combinatorica, 8(3):261-277, 1988.
20. Manor Mendel and Assaf Naor. Ramsey partitions and proximity data structures. In 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 21-24 October 2006, Berkeley, California, USA, Proceedings, pages 109-118, 2006.
21. Manor Mendel and Chaya Schwob. C-K-R partitions of sparse graphs. CoRR, abs/0809.1902, 2008.
22. Peter Bro Miltersen. Cell probe complexity - a survey. Invited talk/paper at Advances in Data Structures (Pre-conference workshop of FSTTCS), 1999.
23. Peter Bro Miltersen, Noam Nisan, Shmuel Safra, and Avi Wigderson. On data structures and asymmetric communication complexity. Journal of Computer and System Sciences, 57(1):37-49, 1998.
24. Pieter Moree. Bertrand's Postulate for primes in arithmetical progressions. Computers & Mathematics with Applications, 26(5):35-43, 1993.
25. Mihai Patrascu. Lower bounds for 2-dimensional range counting. In Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007, pages 40-46, 2007.
26. Mihai Patrascu. (Data) STRUCTURES. In 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, October 25-28, 2008, Philadelphia, PA, USA, pages 434-443, 2008.
27. Mihai Patrascu. Unifying the Landscape of Cell-Probe Lower Bounds. submitted, 2009.
28. Mikkel Thorup. Compact oracles for reachability and approximate distances in planar digraphs. Journal of the ACM, 51(6):993-1024, 2004. Announced at FOCS 2001.
29. Mikkel Thorup and Uri Zwick. Approximate distance oracles. Journal of the ACM, 52(1):1-24, 2005. Announced at STOC 2001.
30. Liam Roditty, Mikkel Thorup, and Uri Zwick. Deterministic constructions of approximate distance oracles and spanners. In Automata, Languages and Programming, 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings, pages 261-272, 2005.
31. David P. Woodruff. Lower bounds for additive spanners, emulators, and more. In 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 21-24 October 2006, Berkeley, California, USA, Proceedings, pages 389-398, 2006.
32. Andrew Chi-Chih Yao. Should tables be sorted? Journal of the ACM, 28(3):615-628, 1981.