Local computation of nearly additive spanners

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

Volumn 5805 LNCS, Issue , 2009, Pages 176-190

  Derbel, Bilel ^a   Gavoille, Cyril ^b   Peleg, David ^c   Viennot, Laurent ^d  

^a UNIV LILLE   (France)

^b UNIVERSITÉ DE BORDEAUX   (France)

^c WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^d INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; ECONOMIC AND SOCIAL EFFECTS; PARAMETER ESTIMATION; POLYNOMIAL APPROXIMATION;

ADDITIVE ERRORS; ADDITIVE SPANNERS; DISTORTION PARAMETERS; DOMINATING SETS; LOCAL COMPUTATION; MAXIMAL INDEPENDENT SET; MULTIPLICATIVE FACTORS; POLYNOMIAL-TIME;

GRAPH THEORY;

EID: 76649111354     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04355-0_20     Document Type: Conference Paper

References (38)

1. rd IEEE International Parallel & Distributed Processing Symposium (IPDPS), IEEE Computer Society Press, Los Alamitos (2009)
2. Adjih, C., Laouiti, A., Muhlethaler, P., Qayyum, A., Viennot, L.: The optimised routing protocol for mobile ad-hoc networks: protocol specification. Technical Report 5145, INRIA (March 2003)
3. th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 77-85. ACM Press, New York (1987)
4. Peleg, D., Schäffer, A.A.: Graph spanners. Journal of Graph Theory 13(1), 99-116 (1989)
5. Awerbuch, B.: Complexity of network synchronization. Journal of the ACM 32(4), 804-823 (1985)
6. Peleg, D., Ullman, J.D.: An optimal synchornizer for the hypercube. SIAM Journal on Computing 18(4), 740-747 (1989)
7. Cohen, E.: Fast algorithms for constructing t-spanners and paths with stretch t. SIAM Journal on Computing 28(1), 210-236 (1998)
8. Elkin, M., Zhang, J.: Efficient algorithms for constructing (1+ ∈, β)-spanners in the distributed and streaming models. Distributed Computing 18(5), 375-385 (2006)
9. 2polylogn) time. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol. 3404, pp. 666-679. Springer, Heidelberg (2005)
10. th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 591-602. IEEE Computer Society Press, Los Alamitos (2006)
11. Thorup, M., Zwick, U.: Approximate distance oracles. Journal of the ACM 52(1), 1-24 (2005)
12. Roditty, L., Thorup, M., Zwick, U.: Deterministic constructions 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)
13. Narasimhan, G., Smid, M.: Geometric Spanner Networks. Cambridge University Press, Cambridge (2007)
14. th Annual ACM Symposium on Theory of Computing (STOC), pp. 81-90. ACM Press, New York (2004)
15. Dor, D., Halperin, S., Zwick, U.: All-pairs almost shortest paths. SIAM Journal on Computing 29(5), 1740-1759 (2000)
16. th Symposium on Discrete Algorithms (SODA), January 2006, pp. 802-809. ACM/SIAM (2006)
17. Bollobás, B., Coppersmith, D., Elkin, M.: Sparse distance preservers and additive spanners. SIAM Journal of Discrete Mathematics 19(4), 1029-1055 (2006)
18. st Annual ACM Symposium on Theory of Computing (STOC). ACM Press, New York (2009)
19. Roditty, L., Thorup, M., Zwick, U.: Roundtrip spanners and roundtrip routing in directed graphs. ACM Transactions on Algorithms 3(4), Article 29 (2008)
20. Pettie, S.: Low distortion spanners. In: Arge, L., Cachin, C., Jurdziński, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596, pp. 78-89. Springer, Heidelberg (2007)
21. Althöfer, I., Das, G., Dobkin, D., Joseph, D.A., Soares, J.: On sparse spanners of weighted graphs. Discrete & Computational Geometry 9(1), 81-100 (1993)
22. Erdös, P.: Extremal problems in graph theory, pp. 29-36. Publ. House Cszechoslovak Acad. Sci., Prague (1964)
23. Erdös, P., Simonovits, M.: Compactness results in extremal graph theory. Combinatorica 2(3), 275-288 (1982)
24. Aingworth, D., Chekuri, C., Indyk, P., Motwani, R.: Fast estimation of diameter and shortest paths (without matrix multiplication). SIAM Journal on Computing 28(4), 1167-1181 (1999)
25. th Symposium on Discrete Algorithms (SODA), pp. 672-681. ACM/SIAM (2005)
26. th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 389-398. IEEE Computer Society Press, Los Alamitos (2006)
27. Elkin, M., Peleg, D.: (1 + ∈, β)-spanner constructions for general graphs. SIAM Journal on Computing 33(3), 608-631 (2004)
28. th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 253-262. ACM Press, New York (2008)
29. 1+1/k) size in weighted graphs. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 384-396. Springer, Heidelberg (2003)
30. th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 273-282. ACM Press, New York (2008)
31. Elkin, M.: Computing almost shortest paths. ACM Transactions on Algorithms 1(2), 283-323 (2005)
32. rd Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 160-168. ACM Press, New York (2004)
33. rd Annual ACM Symposium on Theory of Computing (STOC), pp. 173-182. ACM Press, New York (2001)
34. rd Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 300-309. ACM Press, New York (2004)
35. Linial, N.: Locality in distributed graphs algorithms. SIAM Journal on Computing 21(1), 193-201 (1992)
36. Peleg, D.: Proximity-preserving labeling schemes. Journal of Graph Theory 33(3), 167-176 (2000)
37. Panconesi, A., Srinivasan, A.: On the complexity of distributed network decomposition. Journal of Algorithms 20(2), 356-374 (1996)
38. Luby, M.: A simple parallel algorithm for the maximal independent set problem. SIAM Journal on Computing 15(4), 1036-1053 (1986)