What cannot be computed locally!

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn 23, Issue , 2004, Pages 300-309

  Kuhn, Fabian ^a   Moscibroda, Thomas ^a   Wattenhofer, Roger ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

Approximation hardness; Distributed algorithms; Dominating set; Locality; Lower bounds; Maximal independent set; Maximal matching; Vertex cover

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; GRAPH THEORY; PROGRAM PROCESSORS; SET THEORY;

APPROXIMATION HARDNESS; DISTRIBUTED ALGORITHMS; DOMINATING SET; MAXIMAL INDEPENDENT SET;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 10444251710     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1011767.1011811     Document Type: Conference Paper

References (20)

1. Y. Afek, S. Kutten, and M. Yung. The Local Detection Paradigm and its Applications to Self-Stabilization. Theoretical Computer Science, 186(1-2):199-229, 1997.
2. R. Cole and U. Vishkin. Deterministic Coin Tossing with Applications to Optimal Parallel List Ranking. Information and Control, 70(1):32-53, 1986.
3. th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 359-368, 2004.
4. th ACM Symposium on Theory of Computing (STOC), 2004.
5. U. Feige. A Threshold of In n for Approximating Set Cover. Journal of the ACM (JACM), 45(4):634-652, 1998.
6. F. Fich and E. Ruppert. Hundreds of impossibility results for distributed computing. Distrib. Comput., 16(2-3):121-163, 2003.
7. M. J. Fischer, N. A. Lynch, and M. S. Paterson. Impossibility of Distributed Consensus With One Faulty Process. J. ACM, 32(2):374-382, 1985.
8. A. Israeli and A. Itai. A Fast and Simple Randomized Parallel Algorithm for Maximal Matching. Information Processing Letters, 22:77-80, 1986.
9. nd Annual ACM Symp. on Principles of Distributed Computing (PODC), pages 25-32, 2003.
10. F. Kuhn and R. Wattenhofer. Distributed Combinatorial Optimization. Technical Report 426, ETH Zurich, Dept. of Computer Science, 2003.
11. E. Kushilevitz and Y. Mansour. An Ω(D log(N/D)) Lower Bound for Broadcast in Radio Networks. SIAM Journal on Computing, 27(3):702-712, June 1998.
12. L. Lamport, R. Shostak, and M. Pease. The Byzantine Generals Problem. ACM Trans. Program. Lang. Syst., 4(3):382-401, 1982.
13. F. Lazebnik and V. A. Ustimenko. Explicit Construction of Graphs with an Arbitrary Large Girth and of Large Size. Discrete Applied Mathematics, 60(1-3):275-284, 1995.
14. F. Lazebnik, V. A. Ustimenko, and A. J. Woldar. A New Series of Dense Graphs of High Girth. Bulletin of the American Mathematical Society (N.S.), 32(1):73-79, 1995.
15. N. Linial. Locality in Distributed Graph Algorithms. SIAM Journal on Computing, 21(1):193-201, 1992.
16. th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 63-71, 2001.
17. M. Luby. A Simple Parallel Algorithm for the Maximal Independent Set Problem. SIAM Journal on Computing, 15:1036-1053, 1986.
18. th Annual ACM Symp. on Theory of Computing (STOC), pages 184-193, 1993.
19. D. Peleg. Distributed Computing: A Locality-Sensitive Approach. SIAM, 2000.
20. 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, 2000.