Distributed algorithms for edge dominating sets

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2010, Pages 365-374

  Suomela, Jukka ^a  

^a UNIVERSITY OF HELSINKI   (Finland)

Author keywords

Algorithms; Theory

Indexed keywords

APPROXIMATION RATIOS; DISTRIBUTED ALGORITHM; DISTRIBUTED APPROXIMATION ALGORITHM; EDGE DOMINATING SET; GRAPH G; LOWER BOUNDS; MAXIMUM DEGREE; REGULAR GRAPHS; THEORY; UNIQUE IDENTIFIERS; WORK STUDY;

APPROXIMATION ALGORITHMS;

EID: 77956241764     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1835698.1835783     Document Type: Conference Paper

References (25)

1. R. B. Allan and R. Laskar. On domination and independent domination numbers of a graph. Discrete Math., 23(2):73-76, 1978.
2. D. Angluin. Local and global properties in networks of processors. In Proc. 12th Symposium on Theory of Computing (STOC 1980), pages 82-93. ACM Press, 1980.
3. M. A°strand, P. Floréen, V. Polishchuk, J. Rybicki, J. Suomela, and J. Uitto. A local 2-approximation algorithm for the vertex cover problem. In Proc. 23rd Symposium on Distributed Computing (DISC 2009), volume 5805 of LNCS, pages 191-205. Springer, 2009.
4. M. A°strand and J. Suomela. Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks. In Proc. 22nd Symposium on Parallelism in Algorithms and Architectures (SPAA 2010). ACM Press, 2010.
5. H. Attiya, M. Snir, and M. K. Warmuth. Computing on an anonymous ring. J. ACM, 35(4):845-875, 1988.
6. B. S. Baker. Approximation algorithms for NP-complete problems on planar graphs. J. ACM, 41(1):153-180, 1994.
7. P. Boldi and S. Vigna. An effective characterization of computability in anonymous networks. In Proc. 15th Symposium on Distributed Computing (DISC 2001), volume 2180 of LNCS, pages 33-47. Springer, 2001.
8. R. Carr, T. Fujito, G. Konjevod, and O. Parekh. A 2 1/10 -approximation algorithm for a generalization of the weighted edge-dominating set problem. J. Comb. Optim., 5(3):317-326, 2001.
9. M. Chlebík and J. Chlebíková. Approximation hardness of edge dominating set problems. J. Comb. Optim., 11(3):279-290, 2006.
10. A. Czygrinow, M. Hańćkowiak, and W. Wawrzyniak. Fast distributed approximations in planar graphs. In Proc. 22nd Symposium on Distributed Computing (DISC 2008), volume 5218 of LNCS, pages 78-92. Springer, 2008.
11. R. Diestel. Graph Theory. Springer, 3rd edition, 2005.
12. T. Fujito and H. Nagamochi. A 2-approximation algorithm for the minimum weight edge dominating set problem. Discrete Appl. Math., 118(3):199-207, 2002.
13. M. Hańćkowiak, M. Karónski, and A. Panconesi. On the distributed complexity of computing maximal matchings. In Proc. 9th Symposium on Discrete Algorithms (SODA 1998), pages 219-225. SIAM, 1998.
14. M. Hańćkowiak, M. Karoński, and A. Panconesi. On the distributed complexity of computing maximal matchings. SIAM J. Discrete Math., 15(1):41-57, 2001.
15. H. B. Hunt III, M. V. Marathe, V. Radhakrishnan, S. S. Ravi, D. J. Rosenkrantz, and R. E. Stearns. NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs. J. Algorithms, 26(2):238-274, 1998.
16. D. R. Kowalski and A. Malinowski. How to meet in anonymous network. Theoret. Comput. Sci., 399(1-2):141-156, 2008.
17. C. Lenzen and R. Wattenhofer. Leveraging Linial's locality limit. In Proc. 22nd Symposium on Distributed Computing (DISC 2008), volume 5218 of LNCS, pages 394-407. Springer, 2008.
18. M. Naor and L. Stockmeyer. What can be computed locally? SIAM J. Comput., 24(6):1259-1277, 1995.
19. A. Panconesi and R. Rizzi. Some simple distributed algorithms for sparse networks. Distributed Computing, 14(2):97-100, 2001.
20. J. Petersen. Die Theorie der regulären graphs. Acta Mathematica, 15(1):193-220, 1891.
21. V. Polishchuk and J. Suomela. A simple local 3-approximation algorithm for vertex cover. Inform. Process. Lett., 109(12):642-645, 2009.
22. J. Suomela. Survey of local algorithms, 2009. Manuscript submitted for publication.
23. M. Yamashita and T. Kameda. Computing functions on asynchronous anonymous networks. Mathematical Systems Theory, 29(4):331-356, 1996.
24. M. Yamashita and T. Kameda. Computing on anonymous networks: Part I - characterizing the solvable cases. IEEE Trans. Parallel Distrib. Systems, 7(1):69-89, 1996.
25. M. Yannakakis and F. Gavril. Edge dominating sets in graphs. SIAM J. Appl. Math., 38(3):364-372, 1980.