Networks cannot compute their diameter in sublinear time

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2012, Pages 1150-1162

  Frischknecht, Silvio ^a   Holzer, Stephan ^a   Wattenhofer, Roger ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

COMMUNICATION ROUNDS; DISTRIBUTED COMPUTATIONS; LOWER BOUNDS; SUBLINEAR TIME;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 84860148923     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973099.91     Document Type: Conference Paper

References (27)

1. D. Aingworth, C. Chekuri, P. Indyk, and R. Motwani. Fast estimation of diameter and shortest paths (without matrix multiplication). SIAM Journal on Computing, 28(4):1167-1181, 1999.
2. N. Alon, Z. Galil, and O. Margalit. On the exponent of the all pairs shortest path problem. In Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 569-575, 1991.
3. N. Alon, O. Margalit, Z. Galilt, and M. Naor. Witnesses for boolean matrix multiplication and for shortest paths. In 33rd Annual Symposium on Foundations of Computer Science (FOCS) : October 24-27, 1992, Pittsburg, Pennsylvania: proceedings [papers], page 417. IEEE Computer Society, 1992.
4. G.E. Blelloch, V. Vassilevska, and R. Williams. A new combinatorial approach for sparse graph problems. In Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I (ICALP), pages 108-120. Springer-Verlag, 2008.
5. D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. Journal of symbolic computation, 9(3):251-280, 1990.
6. M. Elkin. Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem. In Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (STOC), pages 331-340. ACM, 2004.
7. F. Fich and E. Ruppert. Hundreds of impossibility results for distributed computing. Distributed computing, 16(2):121-163, 2003.
8. J.A. Garay, S. Kutten, and D. Peleg. A sublinear time distributed algorithm for minimum-weight spanning trees. SIAM Journal on Computing, 27(1):302-316, 1998. (Pubitemid 128596830)
9. R.L. Graham, A.C. Yao, and F.F. Yao. Information bounds are weak in the shortest distance problem. Journal of the ACM (JACM), 27(3):428-444, 1980.
10. T. Hagerup. Improved shortest paths on the word ram. In Proceedings of the 27th International Colloquium on Automata, Languages and Programming (ICALP), pages 61-72. Springer-Verlag, 2000.
11. D.R. Karger, D. Koller, and S.J. Phillips. Finding the hidden path: Time bounds for all-pairs shortest paths. SIAM Journal on Computing, 22:1199, 1993.
12. L.R. Kerr. The effect of algebraic structure on the computational complexity of matrix multiplication, Cornell university, phd thesis. 1970.
13. L. Kor, A. Korman, and D. Peleg. Tight Bounds For Distributed MST Verification. In Thomas Schwentick and Christoph Dürr, editors, 28th International Symposium on Theoretical Aspects of Computer Science (STACS) 2011, volume 9 of Leibniz International Proceedings in Informatics (LIPIcs), pages 69-80, Dagstuhl, Germany, 2011. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik.
14. F. Kuhn, T. Moscibroda, and R. Wattenhofer. What cannot be computed locally! In Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing (PODC), pages 300-309. ACM, 2004.
15. F. Kuhn, T. Moscibroda, and R. Wattenhofer. The price of being near-sighted. In Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm (SODA), SODA '06, pages 980-989, New York, NY, USA, 2006. ACM.
16. E. Kushilevitz and N. Nisan. Communication complexity. Cambridge University Press, 1997.
17. N. Linial. Locality in distributed graph algorithms. SIAM Journal on Computing, 21:193, 1992.
18. Z. Lotker, B. Patt-Shamir, and D. Peleg. Distributed mst for constant diameter graphs. In Proceedings of the twentieth annual ACM symposium on Principles of distributed computing (PODC), pages 63-71. ACM, 2001.
19. D. Nanongkai, A. Das Sarma, and G. Pandurangan. A tight unconditional lower bound on distributed random walk computation. In Proceedings of the 2011 ACM Symposium Principles of Distributed Computing (PODC), pages 257-266, 2011.
20. D. Peleg. Distributed computing: a locality-sensitive approach. Society for Industrial Mathematics, 2000.
21. D. Peleg and V. Rubinovich. A near-tight lower bound on the time complexity of distributed minimum-weight spanning tree construction. SIAM Journal on Computing, 30(5):1427-1442, 2001. (Pubitemid 33099783)
22. S. Pettie. A new approach to all-pairs shortest paths on real-weighted graphs* 1. Theoretical Computer Science, 312(1):47-74, 2004.
23. S. Pettie and V. Ramachandran. A shortest path algorithm for real-weighted undirected graphs. SIAM Journal on Computing, 34(6):1398-1431, 2005. (Pubitemid 43003148)
24. A.D. Sarma, S. Holzer, L. Kor, A. Korman, D. Nanongkai, G. Pandurangan, D. Peleg, and R. Wattenhofer. Distributed verification and hardness of distributed approximation. 43rd ACM Symposium on Theory of Computing (STOC), 2011.
25. R. Seidel. On the all-pairs-shortest-path problem in unweighted undirected graphs. Journal of Computer and System Sciences, 51(3):400-403, 1995.
26. M. Thorup. Undirected single-source shortest paths with positive integer weights in linear time. Journal of the ACM (JACM), 46(3):362-394, 1999.
27. A.C.C. Yao. Some complexity questions related to distributive computing. In Proceedings of the eleventh annual ACM symposium on Theory of computing (STOC), pages 209-213. ACM, 1979.