The price of being near-sighted

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2006, Pages 980-989

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

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CLASSIFICATION (OF INFORMATION); DISTRIBUTED COMPUTER SYSTEMS; PROBLEM SOLVING;

DISTRIBUTED ALGORITHM; GLOBAL SOLUTION; K-NEIGHBORHOOD; PACKING PROBLEMS;

INFORMATION SCIENCE;

EID: 33244479021     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1109557.1109666     Document Type: Conference Paper

References (22)

1. N. Alon, L. Babai, and A. Itai. A fast and simple randomized parallel algorithm for the maximal independent set problem. J. Algorithms, 7(4):567-583, 1986.
2. th Symp. on Foundations of Computer Science (FOCS), pages 303-312, 1997.
3. D. Dubhashi, A. Mei, A. Panconesi, J. Radhakrishnan, and A. Srinivasan. Fast Distributed Algorithms for (Weakly) Connected Dominating Sets and Linear-Size Skeletons. In Proc. of the ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 717-724, 2003.
4. M. Elkin. Unconditional Lower Bounds on the Time-Approximation Tradeoffs for the Distributed Minimum Spanning Tree Problem. In Proc. of the 36th ACM Symposium on Theory of Computing (STOC), 2004.
5. F. Fich and E. Ruppert. Hundreds of impossibility results for distributed computing. Distributed Computing, 16(2-3):121-163, 2003.
6. L. Fleischer. Approximating Fractional Multicommodity Flow Independent of the Number of Commodities. SIAM Journal on Discrete Math., 13(4):505-520, 2000.
7. A. Israeli and A. Itai. A Fast and Simple Randomized Parallel Algorithm for Maximal Matching. Information Processing Letters, 22:77-80, 1986.
8. L. Jia, R. Rajaraman, and R. Suel. An Efficient Distributed Algorithm for Constructing Small Dominating Sets. In Proc. of the 20th Symposium on Principles of Distributed Computing (PODC), pages 33-42, 2001.
9. rd ACM Symp. on Principles of Distributed Computing (PODC), pages 300-309, 2004.
10. F. Kuhn and R. Wattenhofer. Constant-Time Distributed Dominating Set Approximation. In Proc. of the 22nd ACM Symposium on Principles of Distributed Computing (PODC), pages 25-32, 2003.
11. N. Linial. Locality in Distributed Graph Algorithms. SIAM Journal on Computing, 21(1):193-201, 1992.
12. N. Linial and M. Saks. Low Diameter Graph Decompositions. Combinatorica, 13(4):441-454, 1993.
13. M. Luby. A Simple Parallel Algorithm for the Maximal Independent Set Problem. SIAM Journal on Computing, 15:1036-1053, 1986.
14. M. Luby and N. Nisan. A Parallel Approximation Algorithm for Positive Linear Programming. In Proc. of the 25th ACM Symposium on Theory of Computing (STOC), pages 448-457, 1993.
15. M. Naor and L. Stockmeyer. What can be computed locally? SIAM Journal on Computing, 24(6):1259-1277, 1995.
16. C. Papadimitriou and M. Yannakakis. Linear Programming without the Matrix. In Proc. of the 25th Symp. on Theory of Computing (STOC), pages 121-129, 1993.
17. D. Peleg. Distributed Computing: A Locality-Sensitive Approach. SIAM, 2000.
18. S. Plotkin, D. Shmoys, and E. Tardos. Fast Approximation Algorithms for Fractional Packing and Covering Problems. Mathematics of Operations Research, 20:257-301, 1995.
19. S. Rajagopalan and V. Vazirani. Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs. SIAM Journal on Computing, 28:525-540, 1998.
20. th Symp. on Foundations of Computer Science (FOCS), pages 93-102, 2000.
21. N. Young. Randomized Rounding without Solving the Linear Program. In Proc. of the 6th Symposium on Discrete Algorithms (SODA), pages 170-178, 1995.
22. nd Symposium on Foundations of Computer Science (FOCS), pages 538-546, 2001.