Distance oracles for unweighted graphs: Breaking the quadratic barrier with constant additive error

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5125 LNCS, Issue PART 1, 2008, Pages 609-621

  Baswana, Surender ^a   Gaur, Akshay ^b   Sen, Sandeep ^b   Upadhyay, Jayant ^b  

^a INDIAN INSTITUTE OF TECHNOLOGY KANPUR   (India)

^b INDIAN INSTITUTE OF TECHNOLOGY DELHI   (India)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; FILE ORGANIZATION; FOOD ADDITIVES; GRAPH THEORY; LINGUISTICS; TRANSLATION (LANGUAGES);

BEST-KNOWN ALGORITHMS; CONSTANT TIME; PREPROCESSING TIME; UNWEIGHTED GRAPHS; WEIGHTED UNDIRECTED GRAPH;

QUADRATIC PROGRAMMING;

EID: 49049104964     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70575-8_50     Document Type: Conference Paper

References (12)

1. Aingworth, D., Chekuri, C., Indyk, P., Motwani, R.: Fast estimation of diameter and shortest paths(without matrix multiplication). SIAM Journal on Computing 28, 1167-1181 (1999)
2. 2 polylog n) time. In: Proceedings of 22nd Annual Symposium on Theoretical Aspect of Computer Science. LNCS, vol. 3404, pp. 666-679. Springer, Heidelberg (2005)
3. Baswana, S., Kavitha, T.: Faster algorithms for approximate distance oracles and all-pairs small stretch paths. In: Proceedings of the 47th IEEE Annual Symposium on Foundations of Computer Science (FOCS), pp. 591-602 (2006)
4. 2) time. ACM Transactions on Algorithms 2, 557-577 (2006)
5. Baswana, S., Telikepalli, K., Mehlhorn, K., Pettie, S.: New construction of (α, β)-spanners and purely additive spanners. In: Proceedings of 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 672-681 (2005)
6. Chan, T.M.: More algorithms for all-pairs shortest paths in weighted graphs. In: Proceedings of 39th Annual ACM Symposium on Theory of Computing, pp. 590-598 (2007)
7. Cohen, E., Zwick, U.: All-pairs small stretch paths. Journal of Algorithms 38, 335-353 (2001)
8. Dor, D., Halperin, S., Zwick, U.: All pairs almost shortest paths. Siam Journal on Computing 29, 1740-1759 (2000)
9. Erdocombining double acute accents, P.: Extremal problems in graph theory. In: Theory of Graphs and its Applications (Proc. Sympos. Smolenice,1963), pp. 29-36. House Czechoslovak Acad. Sci, Prague (1964)URL, 29
10. Halperin, S., Zwick, U.: Linear time deterministic algorithm for computing spanners for unweighted graphs (unpublished manuscript) (1996)
11. Roditty, L., Thorup, M., Zwick, U.: Deterministic construction of approximate distance oracles and spanners. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 261-272. Springer, Heidelberg (2005)
12. Thorup, M., Zwick, U.: Approximate distance oracles. Journal of Association of Computing Machinery 52, 1-24 (2005)