Distributed verification and hardness of distributed approximation

SIAM Journal on Computing

Volumn 41, Issue 5, 2012, Pages 1235-1265

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

^a EBAY INC   (United States)

^b ETH ZURICH   (Switzerland)

^c WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^d CNRS   (France)

^e UNIVERSITY OF VIENNA   (Austria)

^f NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^g Brown Univerity   (United States)

Author keywords

Communication complexity; Distributed algorithms; Graph optimization problems; Hardness of approximation; Lower bounds

Indexed keywords

APPROXIMATION FACTOR; CLASSICAL OPTIMIZATION; COMMUNICATION COMPLEXITY; DISTRIBUTED APPROXIMATION ALGORITHM; DISTRIBUTED COMMUNICATIONS; DISTRIBUTED COMPUTATIONS; DISTRIBUTED NETWORKS; EXACT ALGORITHMS; GRAPH OPTIMIZATION; HARDNESS OF APPROXIMATION; LOWER BOUNDS; LOWER-BOUND PROOFS; MINIMUM CUT; MINIMUM SPANNING TREES; RUNNING TIME; SHORTEST PATH; SUBGRAPHS; SYSTEMATIC STUDY; TIME COMPLEXITY; VERIFICATION ALGORITHMS; VERIFICATION PROBLEMS;

COMMUNICATION; COMPUTATION THEORY; DISTRIBUTED COMPUTER SYSTEMS; GRAPH THEORY; HARDNESS; OPTIMIZATION; PARALLEL ALGORITHMS;

APPROXIMATION ALGORITHMS;

EID: 84868241109     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/11085178X     Document Type: Conference Paper

References (43)

1. L. Babai, P. Frankl, and J. Simon, Complexity classes in communication complexity theory (preliminary version), in Proceedings of FOCS, IEEE,Washington, DC, 1986, pp. 337-347.
2. Z. Bar-Yossef, T. S. Jayram, R. Kumar, and D. Sivakumar, An information statistics approach to data stream and communication complexity, J. Comput. System Sci., 68 (2004), pp. 702-732.
3. A. Chattopadhyay and T. Pitassi, The story of set disjointness, SIGACT News, 41 (2010), pp. 59-85.
4. E. Cohen, Size-estimation framework with applications to transitive closure and reachability, J. Comput. System Sci., 55 (1997), pp. 441-453.
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, in Proceedings of STOC, ACM, New York, 2011, pp. 363-372.
6. D. P. Dubhashi, F. Grandoni, and A. Panconesi, Distributed algorithms via LP duality and randomization, in Handbook of Approximation Algorithms and Metaheuristics, Chapman and Hall/CRC, Boca Raton, FL, 2007, pp. 13-1-13-22.
7. M. Elkin, Distributed approximation: A survey, SIGACT News, 35 (2004), pp. 40-57.
8. M. Elkin, Computing almost shortest paths, ACM Trans. Algorithms, 1 (2005), pp. 283-323.
9. M. Elkin, A faster distributed protocol for constructing a minimum spanning tree, J. Comput. System Sci., 72 (2006), pp. 1282-1308.
10. M. Elkin, An unconditional lower bound on the time-approximation trade-off for the distributed minimum spanning tree problem, SIAM J. Comput., 36 (2006), pp. 433-456.
11. S. Frischknecht, S. Holzer, and R. Wattenhofer, Networks cannot compute their diameter in sublinear time, in SODA, ACM, New York, SIAM, Philadelphia, 2012.
12. J. A. Garay, S. Kutten, and D. Peleg, A sublinear time distributed algorithm for minimumweight spanning trees, SIAM J. Comput., 27 (1998), pp. 302-316.
13. M. R. Henzinger, P. Raghavan, and S. Rajagopalan, Computing on data streams, in External Memory Algorithms, J. M. Abello and J. S. Vitter, eds., AMS, Providence, RI, 1999, pp. 107-118.
14. S. Holzer and R. Wattenhofer, Optimal distributed all pairs shortest paths and applications, in Proceedings of PODC, ACM, New York, 2012, pp. 355-364.
15. B. Kalyanasundaram and G. Schnitger, The probabilistic communication complexity of set intersection, SIAM J. Discrete Math., 5 (1992), pp. 545-557.
16. M. Khan, F. Kuhn, D. Malkhi, G. Pandurangan, and K. Talwar, Efficient distributed approximation algorithms via probabilistic tree embeddings, in Proceedings of PODC, ACM, New York, 2008, pp. 263-272.
17. L. Kor, A. Korman, and D. Peleg, Tight bounds for distributed MST verification, in Proceedings of STACS, Technische Universität Dortmund, Dortmund, Gerany, 2011, pp. 69-80.
18. A. Korman and S. Kutten, Distributed verification of minimum spanning trees, Distributed Computing, 20 (2007), pp. 253-266.
19. A. Korman, S. Kutten, and T. Masuzawa, Fast and compact self stabilizing verification, computation, and fault detection of an mst, in Proceedings of PODC, 2011, ACM, New York, pp. 311-320.
20. F. Kuhn, T. Moscibroda, and R. Wattenhofer, What cannot be computed locally!, in Proceedings of PODC, ACM, New York, 2004, pp. 300-309.
21. F. Kuhn, T. Moscibroda, and R. Wattenhofer, Local computation: Lower and upper bounds, preprint, http://arxiv.org/abs/1011.5470, 2010.
22. F. Kuhn and R. Oshman, The complexity of data aggregation in directed networks, in DISC, Sapienza Universitá di Roma, Rome, Italy, 2011.
23. E. Kushilevitz and N. Nisan, Communication Complexity, Cambridge University Press, New York, 1997.
24. S. Kutten and D. Peleg, Fast distributed construction of small k-dominating sets and applications, J. Algorithms, 28 (1998), pp. 40-66.
25. F. T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes, Morgan Kaufmann, San Francisco, CA, 1991.
26. N. Linial, Locality in distributed graph algorithms, SIAM J. Comput., 21 (1992), pp. 193-201.
27. Z. Lotker, B. Patt-Shamir, and D. Peleg, Distributed MST for constant diameter graphs, Distributed Computing, 18 (2006), pp. 453-460.
28. Z. Lotker, E. Pavlov, B. Patt-Shamir, and D. Peleg, MST construction in O(log log n) communication rounds, in Proceedings of SPAA, ACM, New York, 2003, pp. 94-100.
29. M. Luby, A simple parallel algorithm for the maximal independent set problem, SIAM J. Comput., 15 (1986), pp. 1036-1053.
30. N. Lynch, Distributed Algorithms, Morgan Kaufmann, San Francisco, CA, 1996.
31. R. Motwani and P. Raghavan, Randomized Algorithms, Cambridge University Press, New York, 1995.
32. D. Nanongkai, A. Das Sarma, and G. Pandurangan, A tight unconditional lower bound on distributed randomwalk computation, in Proceedings of PODC, ACM, New York, 2011, pp. 257-266.
33. D. Peleg, Distributed Computing: A Locality-Sensitive Approach, SIAM, Philadelphia, 2000.
34. D. Peleg, L. Roditty, and E. Tal, Distributed algorithms for network diameter and girth, in ICALP, University of Warwick, Warwick, UK, 2012, pp. 660-672.
35. 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 (2000), pp. 1427-1442.
36. R. Raz and B. Spieker, On the "log rank"-conjecture in communication complexity, Combinatorica, 15 (1995), pp. 567-588.
37. A. A. Razborov, On the distributional complexity of disjointness, Theoret. Comput. Sci., 106 (1992), pp. 385-390.
38. R. E. Tarjan, Applications of path compression on balanced trees, J. ACM, 26 (1979), pp. 690-715.
39. R. Thurimella, Sub-linear distributed algorithms for sparse certificates and biconnected components, J. Algorithms, 23 (1997), pp. 160-179.
40. V. V. Vazirani, Approximation Algorithms, Springer, New York, 2001.
41. 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 (1999), pp. 761-778.
42. A. C.-C. Yao, Probabilistic computations: Toward a unified measure of complexity, in Proceedings of FOCS, IEEE, Washington, DC, 1977, pp. 222-227.
43. A. C.-C. Yao, Some complexity questions related to distributive computing (preliminary report), in Proceedings of STOC, ACM, New York, 1979, pp. 209-213.