Distributed and parallel algorithms for weighted vertex cover and other covering problems

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2009, Pages 171-179

  Koufogiannakis, Christos ^a   Young, Neal E ^a  

^a University of California Riverside   (United States)

Author keywords

Distributed covering; Distributed vertex cover

Indexed keywords

COVERING PROBLEMS; DISTRIBUTED AND PARALLEL ALGORITHM; DISTRIBUTED COVERING; DISTRIBUTED VERTEX COVER; FACILITY LOCATIONS; MIXED INTEGER LINEAR PROGRAM; SUBMODULAR; TWO STAGE; VERTEX COVER;

COMPUTER SCIENCE; FACILITIES; INTEGER PROGRAMMING; PARALLEL ALGORITHMS;

APPROXIMATION ALGORITHMS;

EID: 70350651636     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1582716.1582746     Document Type: Conference Paper

References (39)

1. R. Bar-Yehuda and S. Even. A linear-time approximation algorithm for the weighted vertex cover problem. Journal of Algorithms, 2(2):198-203, 1981.
2. R. Bar-Yehuda and S. Even. A local-ratio theorem for approximating the weighted vertex cover problem. Annals of Discrete Mathematics, 25(27-46):50, 1985.
3. D. Bertsimas and R. Vohra. Rounding algorithms for covering problems. Mathematical Programming: Series A and B, 80(1):63-89, 1998.
4. R. D. Carr, L. K. Fleischer, V. J. Leung, and C. A. Phillips. Strengthening integrality gaps for capacitated network design and covering problems. In the eleventh ACM-SIAM Symposium On Discrete Algorithms, pages 106-115, Philadelphia, PA, USA, 2000. Society for Industrial and Applied Mathematics.
5. Z.-Z. Chen. A fast and efficient nc algorithm for maximal matching. Information Processing Letters, 55:303-307, 1995.
6. V. Chvátal. A greedy heuristic for the set-covering problem. Mathematics of Operations Research, 4:233-235, 1979.
7. A. Czygrinow, M. Hańćkowiak, and W. Wawrzyniak. Distributed packing in planar graphs. In the twentieth ACM Symposium on Parallel Algorithms and Architectures, pages 55-61, 2008.
8. F. Grandoni, J. Könemann, A. Panconesi, and M. Sozio. Primal-dual based distributed algorithms for vertex cover with semi-hard capacities. In the twenty-fourth ACM symposium on Principles Of Distributed Computing, pages 118-125, 2005.
9. F. Grandoni, J. Könemann, A. Panconesi, and M. Sozio. A primal-dual bicriteria distributed algorithm for capacitated vertex cover. SIAM Journal on Computing, 38(3):825-840, 2008.
10. F. Grandoni, J. Könemann, J., and A. Panconesi. Distributed weighted vertex cover via maximal matchings. Lecture Notes in Computer Science, 3595:839-848, 2005.
11. N. Hall and D. Hochbaum. A fast approximation algorithm for the multicovering problem. Discrete Applied Mathematics, 15(1):35-40, 1986.
12. M. Hańćkowiak, M. Karonski, and A. Panconesi. On the distributed complexity of computing maximal matchings. SIAM Journal of Discrete Mathematics, 15(1):41-57, 2001.
13. D. Hochbaum. Approximation algorithms for the set covering and vertex cover problems. SIAM Journal on Computing, 11:555-556, 1982.
14. D. S. Hochbaum. Efficient bounds for the stable set, vertex cover, and set packing problems. Discrete Applied Mathematics, 6:243-254, 1983.
15. J. Hoepman. Simple distributed weighted matchings. Arxiv preprint cs.DC/0410047, 2004.
16. A. Israeli and A. Itai. A fast and simple randomized parallel algorithm for maximal matching. Information Processing Letters, 22:77-80, 1986.
17. L. Jia, R. Rajaraman, and T. Suel. An efficient distributed algorithm for constructing small dominating sets. In the twentieth ACM symposium on the Principles Of Distributed Computing, pages 33-42, 2001.
18. D. S. Johnson. Approximation algorithms for combinatorial problems. In the fifth ACM Symposium On Theory Of Computing, 25:38-49, 1973.
19. P. Kelsen. An optimal parallel algorithm for maximal matching. Information Processing Letters, 52:223-228, 1994.
20. S. Khuller, U. Vishkin, and N. Young. A primal-dual parallel approximation technique applied to weighted set and vertex covers. Journal of Algorithms, 17:280-289, 1994.
21. S. Kolliopoulos and N. Young. Approximation algorithms for covering/packing integer programs. Journal of Computer and System Sciences, 71(4):495-505, 2005.
22. C. Koufogiannakis and N. Young. Greedy Δ-approximation algorithm for covering with arbitrary constraints and submodular cost. In the thirty-sixth International Colloquium on Automata, Languages and Programming, LNCS 5555:634-652, 2009. See also http://arxiv.org/abs/0807. 0644.
23. F. Kuhn and T. Moscibroda. Distributed approximation of capacitated dominating sets. In the nineteenth ACM Symposium on Parallelism in Algorithms and Architectures, pages 161-170, 2007.
24. F. Kuhn, T. Moscibroda, and R. Wattenhofer. What cannot be computed locally! In the twenty-third ACM symposium on Principles Of Distributed Computing, pages 300-309, 2004.
25. F. Kuhn, T. Moscibroda, and R. Wattenhofer. The price of being near-sighted. In the seventeenth ACM-SIAM Symposium On Discrete Algorithm, pages 980-989, 2006.
26. F. Kuhn and R. Wattenhofer. Constant-time distributed dominating set approximation. In the twenty-second ACM symposium on the Principles Of Distributed Computing, pages 25-32, 2003.
27. C. Lenzen, Y. Oswald, and R. Wattenhofer. What can be approximated locally?: case study: dominating sets in planar graphs. In the twentieth ACM Symposium on Parallel Algorithms and Architectures, pages 46-54, 2008.
28. N. Linial and M. Saks. Low diameter graph decompositions. Combinatorica, 13(4):441-454, 1993.
29. N. Linian. Locality in distributed graph algorithms. SIAM Journal on Computing, 21:193-201, 1992.
30. Z. Lotker, B. Patt-Shamir, and S. Pettie. Improved distributed approximate matching. In the twelfth ACM Symposium on Parallelism in Algorithms and Architectures, pages 129 -136, 2008.
31. Z. Lotker, B. Patt-Shamir, and A. Rosén. Distributed approximate matching. In the twenty-sixth ACM symposium on Principles Of Distributed Computing, pages 167-174, 2007.
32. L. Lovász. On the ratio of optimal integral and fractional covers. Discrete Math, 13:383-390, 1975.
33. N. Luby. A simple parallel algorithm for the maximal independent set problem. In the seventh ACM Symposium on Theory Of Computing, pages 1-10, 1985.
34. M. Naor and L. Stockmeyer. What can be computed locally? SIAM Journal on Computing, 24:1259-1277, 1995. STOC' 93.
35. A. Panconesi and R. Rizzi. Some simple distributed algorithms for sparse networks. Distributed Computing, 14:97-100, 2001.
36. D. Peleg. Distributed computing: a locality-sensitive approach. Society for Industrial and Applied Mathematics, 2000.
37. A. Srinivasan. Improved approximation guarantees for packing and covering integer programs. SIAM Journal on Computing, 29:648-670, 1999.
38. A. Srinivasan. New approaches to covering and packing problems. In the twelveth ACM-SIAM Symposium On Discrete Algorithms, pages 567-576, 2001.
39. M. Wattenhofer and R. Wattenhofer. Distributed weighted matching. Lecture Notes in Computer Science, 3274:335-348, 2004.