A self-stabilizing approximation algorithm for the distributed minimum k-domination

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E88-A, Issue 5, 2005, Pages 1109-1115

  Kamei, Sayaka ^a   Kakugawa, Hirotsugu ^a  

^a HIROSHIMA UNIVERSITY   (Japan)

Author keywords

Approximation; Fault tolerance; General networks; Minimum k dominating set; Self stabilizing distributed algorithm

Indexed keywords

APPROXIMATION THEORY; GRAPH THEORY; PROBLEM SOLVING; SET THEORY;

FAULT-TOLERANCE; GENERAL NETWORKS; MINIMUM K-DOMINATING SET; SELF-STABILIZING DISTRIBUTED ALGORITHM;

ALGORITHMS;

EID: 24144479482     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: 10.1093/ietfec/e88-a.5.1109     Document Type: Article

References (18)

1. F.C. Gärtner. "Fundamentals of fault-tolerant distributed computing in asynchronous environments." ACM Comput. Surv., vol.31, no.1, pp. 1-26, 1996.
2. E.W, Dijkstra, "Self-stabilizing systems in spite of distributed control," Commun. ACM, vol. 17, no. 11, pp.643-644, 1974.
3. S. Dolev, Self-Stabilization, The MIT Press. Cambridge. MA. 2000.
4. J.F. Fink and M.S. Jacobson, n-domination in graphs. John Wiley and Sons, 1985.
5. T.W. Haynes, S.T. Hedetniemi, and PJ. Slater. Fundamentals of Domination in Graphs, Marcel Dekker. Inc., 1998.
6. O. Favaron, "k-domination and k-independence in graphs." ARS Combinatoria. vol.25, pp. 159-167, 1988.
7. L. Jia, R. Rajaraman. and T. Suel. "An efficient distributed algorithm for constructing small dominating sets." Distrib. Comput., vol.15, no.4, pp.193-205.2002.
8. F. Kuhn and R. Wattenhofer, "Constant-time distributed dominating set approximation." Proc. Twenty-second Annual Symposium on Principles of Distributed Computing, pp.25-32, 2003.
9. S. Kutten and D. Peleg, "Fast distributed construction of small k-dominating sets and applications." J. Algorithms, vol.28, no. 1. pp.40-66, 1998.
10. L.D. Penso and V.C. Barbosa. "A distributed algorithm to find k-dominating sets," Discrete Applied Mathematics, vol.141, no.1-3, pp.243-253, 2004.
11. C.Z. Xu, S.T. Hedetniemi, W. Goddard, and P.K. Srimani, "A synchronous self-stabilizing minimal domination protocol in an arbitrary network graph," Proc. 5th International Workshop on Distributed Computing, pp.26-32. Dec. 2003.
12. S. Hedetniemi, S.T. Hedetniemi, D.P. Jacobs, and P.K. Srimani, "Self-stabilizing algorithms for minimal dominating sets and maximal independent sets," Comput. Math. Appl., vol.46, no.5-6, pp.805-811,2003.
13. W. Goddard, S.T. Hedetniemi, D.P. Jacobs, and P.K. Srimani, "A self-stabilizing distributed algorithm for minimal total domination in an arbitrary system graph," Proc. 17th IPDPS Workshop on Formal Methods for Parallel Programming: Theory and Applications, p.240. April 2003.
14. S. Kamei and H. Kakugawa. "A self-stabilizing algorithm for the distributed mimimal k-redundant dominating set problem in tree network," Proc. Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies, pp.720-724, Aug. 2003.
15. T. Herman and S. Ghosh, "Stabilizing phase-clocks," Inf. Process. Lett., vol.54, no.5, pp.259-265, 1995.
16. T. Herman, "Phase clocks for transient fault repair," IEEE Trans. Parallel Distrib. Syst., vol.11, no. 10. pp. 1048-1057, 2000.
17. M.M. Halldorsson and J. Radhakrishnan. "Greed is good: Approximating independent sets in sparse and bounded-degree graphs." Proc. 26th Annual ACM Symposium on Theory of Computing, pp. 439-148, 1994.
18. S.K. Shukla, D.J. Rosenkrantz, and S.S. Ravi, "Observation on self-stabilizing graph algorithms for anonymous networks." Proc. Second Workshop on Self-Stabilizing Systems, pp.7.1-7.15, 1995.