Distributed verification and hardness of distributed approximation

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2011, Pages 363-372

  Das Sarma, Atish ^a   Holzer, Stephan ^b   Kor, Liah ^c   Korman, Amos ^d   Nanongkai, Danupon ^e,f   Pandurangan, Gopal ^g,h   Peleg, David ^c   Wattenhofer, Roger ^b  

^a GOOGLE INC   (United States)

^b ETH ZURICH   (Switzerland)

^c WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^d CNRS   (France)

^e UNIVERSITY OF VIENNA   (Austria)

^f GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^g NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^h BROWN UNIVERSITY   (United States)

Author keywords

communication complexity; distributed algorithms; graph algorithms; lower bound; minimum spanning tree; shortest path; time complexity

Indexed keywords

APPROXIMATION ALGORITHMS; CLUSTERING ALGORITHMS; COMPLEX NETWORKS; COMPUTATIONAL COMPLEXITY; GRAPH ALGORITHMS; HARDNESS; PARALLEL ALGORITHMS;

COMMUNICATION COMPLEXITY; LOWER BOUNDS; MINIMUM SPANNING TREES; SHORTEST PATH; TIME COMPLEXITY;

TREES (MATHEMATICS);

EID: 79959733661     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1993636.1993686     Document Type: Conference Paper

References (30)

1. L. Babai, P. Frankl, and J. Simon. Complexity classes in communication complexity theory (preliminary version). In FOCS, pages 337-347, 1986.
2. Z. Bar-Yossef, T. S. Jayram, R. Kumar, and D. Sivakumar. An information statistics approach to data stream and communication complexity. J. Comput. Syst. Sci., 68(4):702-732, 2004. Also in FOCS'02.
3. A. Chattopadhyay and T. Pitassi. The Story of Set Disjointness. SIGACT News, 41(3):59-85, 2010.
4. E. Cohen. Size-Estimation Framework with Applications to Transitive Closure and Reachability. J. Comput. Syst. Sci., 55(3):441-453, 1997. Also in FOCS'94. (Pubitemid 127432363)
5. A. Das Sarma, S. Holzer, L. Kor, A. Korman, D. Nanongkai, G. Pandurangan, D. Peleg, and R. Wattenhofer. Distributed verification and hardness of distributed approximation. CoRR, abs/1011.3049, 2010.
6. D. P. Dubhashi, F. Grandioni, and A. Panconesi. Distributed Algorithms via LP Duality and Randomization. In Handbook of Approximation Algorithms and Metaheuristics. Chapman and Hall/CRC, 2007.
7. M. Elkin. Distributed approximation: a survey. SIGACT News, 35(4):40-57, 2004.
8. M. Elkin. Computing almost shortest paths. ACM Transactions on Algorithms, 1(2):283-323, 2005. Also in PODC'01.
9. M. Elkin. A faster distributed protocol for constructing a minimum spanning tree. J. Comput. Syst. Sci., 72(8):1282-1308, 2006. Also in SODA'04. (Pubitemid 44647248)
10. M. Elkin. An Unconditional Lower Bound on the Time-Approximation Trade-off for the Distributed Minimum Spanning Tree Problem. SIAM J. Comput., 36(2):433-456, 2006. Also in STOC'04. (Pubitemid 46627295)
11. J. A. Garay, S. Kutten, and D. Peleg. A Sublinear Time Distributed Algorithm for Minimum-Weight Spanning Trees. SIAM J. Comput., 27(1):302-316, 1998. Also in FOCS '93. (Pubitemid 128596830)
12. M. R. Henzinger, P. Raghavan, and S. Rajagopalan. Computing on data streams. In J. M. Abello and J. S. Vitter, editors, External memory algorithms, pages 107-118. American Mathematical Society, Boston, MA, USA, 1999.
13. B. Kalyanasundaram and G. Schnitger. The Probabilistic Communication Complexity of Set Intersection. SIAM J. Discrete Math., 5(4):545-557, 1992.
14. M. Khan, F. Kuhn, D. Malkhi, G. Pandurangan, and K. Talwar. Efficient distributed approximation algorithms via probabilistic tree embeddings. In PODC, pages 263-272, 2008.
15. L. Kor, A. Korman, and D. Peleg. Tight bounds for distributed MST verification. STACS, 2011.
16. A. Korman and S. Kutten. Distributed verification of minimum spanning trees. Distributed Computing, 20(4):253-266, 2007. Also in PODC'06. (Pubitemid 350005916)
17. F. Kuhn, T. Moscibroda, and R. Wattenhofer. What cannot be computed locally! In PODC, pages 300-309, 2004.
18. E. Kushilevitz and N. Nisan. Communication complexity. Cambridge University Press, New York, NY, USA, 1997.
19. S. Kutten and D. Peleg. Fast Distributed Construction of Small k-Dominating Sets and Applications. J. Algorithms, 28(1):40-66, 1998. Also in PODC'95. (Pubitemid 128638748)
20. N. Linial. Locality in distributed graph algorithms. SIAM J. Comput., 21(1):193-201, 1992.
21. Z. Lotker, B. Patt-Shamir, and D. Peleg. Distributed MST for constant diameter graphs. Distributed Computing, 18(6):453-460, 2006. Also in PODC'01. (Pubitemid 43824395)
22. M. Luby. A simple parallel algorithm for the maximal independent set problem. SIAM J. Comput., 15(4):1036-1053, 1986. Also in STOC'85. (Pubitemid 17465853)
23. N. Lynch. Distributed Algorithms. Morgan Kaufmann, 1996.
24. D. Peleg. Distributed computing: a locality-sensitive approach. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2000.
25. D. Peleg and V. Rubinovich. A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction. SIAM J. Comput., 30(5):1427-1442, 2000. Also in FOCS'99. (Pubitemid 33099783)
26. A. A. Razborov. On the Distributional Complexity of Disjointness. Theor. Comput. Sci., 106(2):385-390, 1992. Also in ICALP'90.
27. R. E. Tarjan. Applications of path compression on balanced trees. J. ACM, 26(4):690-715, 1979.
28. V. V. Vazirani. Approximation Algorithms. Springer, July 2001.
29. B. Y. Wu, G. Lancia, V. Bafna, K.-M. Chao, R. Ravi, and C. Y. Tang. A polynomial-time approximation scheme for minimum routing cost spanning trees. SIAM J. Comput., 29(3):761-778, 1999. Also in SODA'98.
30. A. C.-C. Yao. Probabilistic Computations: Toward a Unified Measure of Complexity. In FOCS, pages 222-227, 1977.