M. Fawaz, M. Al-azemi, and . Hakan-karaata, Brief announcement: A stabilizing algorithm for finding two edge-disjoint paths in arbitrary graphs, 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems, pp.433-434, 2011.

F. Belkouch, M. Bui, L. Chen, and A. Datta, Self-stabilizing deterministic network decomposition, J. Parallel Distrib. Comput, vol.62, issue.4, pp.696-714, 2002.

D. Bein, A. Kumar-datta, C. R. Jagganagari, and V. Villain, A selfstabilizing link-cluster algorithm in mobile ad hoc networks, 8th International Symposium on Parallel Architectures, Algorithms, and Networks, pp.436-441, 2005.

J. Blum, M. Ding, A. Thaeler, and X. Cheng, Connected Dominating Set in Sensor Networks and MANETs, 2005.

R. Bar-yehuda and S. Even, A local ratio theorem for approximating the weighted vertex cover problem, Annals of Discrete Mathematics, vol.25, pp.27-46, 1985.

Z. Collin and S. Dolev, Self-stabilizing depth-first search, Information Processing Letters, vol.49, issue.6, pp.297-301, 1994.

E. Caron, A. Datta, B. Depardon, and L. L. Larmore, A self-stabilizing k-clustering algorithm for weighted graphs, J. Parallel Distrib. Comput, vol.70, issue.11, pp.1159-1173, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00758590

A. Cournier, S. Devismes, F. Petit, and V. Villain, Snap-stabilizing depthfirst search on arbitrary networks, The Computer Journal, vol.49, issue.3, pp.268-280, 2006.

A. Cournier, S. Rovedakis, and V. Villain, The first fully polynomial stabilizing algorithm for bfs tree construction, 15th International Conference on Principles of Distributed Systems, pp.159-174, 2011.
URL : https://hal.archives-ouvertes.fr/hal-01009450

E. W. Dijkstra, Self-stabilizing systems in spite of distributed control, Commun. ACM, vol.17, issue.11, pp.643-644, 1974.

S. Dolev, A. Israeli, and S. Moran, Self-stabilization of dynamic systems assuming only read/write atomicity, Distributed Computing, vol.7, issue.1, pp.3-16, 1993.

. Dld-+-12-;-ajoy-kumar, L. L. Datta, S. Larmore, K. Devismes, Y. Heurtefeux et al., Competitive self-stabilizing k-clustering, IEEE 32nd International Conference on Distributed Computing Systems, pp.476-485, 2012.

F. Delbot, C. Laforest, and R. Phan, New approximation algorithms for the vertex cover problem, 24th International Workshop on Combinatorial Algorithms (IWOCA), vol.8288, pp.438-442, 2013.
URL : https://hal.archives-ouvertes.fr/hal-01215211

S. Dolev, Self-Stabilization, 2000.
URL : https://hal.archives-ouvertes.fr/inria-00627780

I. Dinur and S. Safra, On the hardness of approximating minimum vertex cover, Annals of mathematics, vol.162, issue.1, pp.439-485, 2005.

B. Escoffier, L. Gourvès, and J. Monnot, Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs, J. Discrete Algorithms, vol.8, issue.1, pp.36-49, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00178912

W. Goddard, S. T. Hedetniemi, D. P. Jacobs, and P. K. Srimani, Selfstabilizing protocols for maximal matching and maximal independent sets for ad hoc networks, 17th International Parallel and Distributed Processing Symposium, p.162, 2003.

M. Garey and D. Johnson, Computers and Intractability, 1979.

N. Guellati and H. Kheddouci, A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs, J. Parallel Distrib. Comput, vol.70, issue.4, pp.406-415, 2010.

. Shing-tsaan, N. Huang, and . Chen, A self-stabilizing algorithm for constructing breadth-first trees, Information Processing Letters, vol.41, issue.2, pp.109-117, 1992.

C. Su, S. Hsu, and . Huang, A self-stabilizing algorithm for maximal matching, Inf. Process. Lett, vol.43, issue.2, pp.77-81, 1992.

T. Stephen, D. P. Hedetniemi, P. K. Jacobs, and . Srimani, Maximal matching stabilizes in time o(m), Inf. Process. Lett, vol.80, issue.5, pp.221-223, 2001.

R. Hadid and . Mehmet-hakan-karaata, Stabilizing maximum matching in bipartite networks, Computing, vol.84, issue.1-2, pp.121-138, 2009.

H. Ishii and H. Kakugawa, A self-stabilizing algorithm for finding cliques in distributed systems, 21st Symposium on Reliable Distributed Systems (SRDS), pp.390-395, 2002.

A. Jain and A. Gupta, A distributed self-stabilizing algorithm for finding a connected dominating set in a graph, 6th International Conference on Parallel and Distributed Computing, Applications and Technologies, pp.615-619, 2005.

C. Johnen and L. Huy-nguyen, Robust self-stabilizing weight-based clustering algorithm, Theor. Comput. Sci, vol.410, issue.6-7, pp.581-594, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00564967

C. Johnen, Memory-efficient self-stabilizing algorithm to construct bfs spanning trees, 3rd Workshop on Self-stabilizing Systems, pp.125-140, 1997.

G. Karakostas, A better approximation ratio for the vertex cover problem, International Colloquium on Automata, Languages and Programming, pp.1043-1050, 2005.

J. Kiniwa, Approximation of self-stabilizing vertex cover less than 2, 7th International Symposium on Self-Stabilizing Systems (SSS), vol.3764, pp.171-182, 2005.

S. Kamei, T. Izumi, and Y. Yamauchi, An asynchronous self-stabilizing approximation for the minimum connected dominating set with safe convergence in unit disk graphs, 15th International Symposium on Stabilization, Safety, and Security of Distributed Systems, vol.8255, pp.251-265, 2013.

S. Kamei and H. Kakugawa, A self-stabilizing distributed approximation algorithm for the minimum connected dominating set, Int. J. Found. Comput. Sci, vol.21, issue.3, pp.459-476, 2010.

S. Kamei and H. Kakugawa, A self-stabilizing 6-approximation for the minimum connected dominating set with safe convergence in unit disk graphs, Theor. Comput. Sci, vol.428, pp.80-90, 2012.

S. Khot and O. Regev, Vertex cover might be hard to approximate to within 2 ? ?, Journal of Computer and System Sciences, vol.74, issue.3, pp.335-349, 2008.

F. Manne and M. Mjelde, A self-stabilizing weighted matching algorithm, 9th International Symposium on Stabilization, Safety, and Security of Distributed Systems, pp.383-393, 2007.

F. Manne, M. Mjelde, L. Pilard, and S. Tixeuil, A new self-stabilizing maximal matching algorithm, Theor. Comput. Sci, vol.410, issue.14, pp.1336-1345, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00127899

F. Manne, M. Mjelde, L. Pilard, and S. Tixeuil, A self-stabilizing 2/3-approximation algorithm for the maximum matching problem, Theor. Comput. Sci, vol.412, issue.40, pp.5515-5526, 2011.
URL : https://hal.archives-ouvertes.fr/hal-01154122

B. Monien and E. Speckenmeyer, Ramsey numbers and an approximation algorithm for the vertex cover problem, Acta Informatica, vol.22, issue.1, pp.115-123, 1985.

B. Neggazi, M. Haddad, and H. Kheddouci, Self-stabilizing algorithm for maximal graph decomposition into disjoint paths of fixed length, 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS), pp.15-19, 2012.
URL : https://hal.archives-ouvertes.fr/hal-01353133

B. Neggazi, M. Haddad, and H. Kheddouci, Self-stabilizing algorithm for maximal graph partitioning into triangles, 14th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), vol.7596, pp.31-42, 2012.
URL : https://hal.archives-ouvertes.fr/hal-01353073

S. Ni, Y. Tseng, Y. Chen, and J. Sheu, The broadcast storm problem in a mobile ad hoc network, 5th Annual ACM/IEEE International Conference on Mobile Computing and Networking, pp.151-162, 1999.

B. Neggazi, V. Turau, M. Haddad, and H. Kheddouci, A selfstabilizing algorithm for maximal p-star decomposition of general graphs, 15th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), vol.8255, pp.74-85, 2013.
URL : https://hal.archives-ouvertes.fr/hal-01339275

F. Petit and V. Villain, Optimal snap-stabilizing depth-first token circulation in tree networks, Journal of Parallel and Distributed Computing, vol.67, issue.1, pp.1-12, 2007.

C. Papadimitriou and M. Yannakakis, Optimization, approximation, and complexity classes, 20th annual ACM symposium on Theory of computing, pp.229-234, 1988.

C. D. Savage, Depth-first search and the vertex cover problem, Information Processing Letters, vol.14, issue.5, pp.233-237, 1982.

V. Turau and B. Hauck, A fault-containing self-stabilizing (3 -2/(delta+1))-approximation algorithm for vertex cover in anonymous networks, Theoretical Computer Science, vol.412, issue.33, pp.4361-4371, 2011.

V. Turau and B. Hauck, A new analysis of a self-stabilizing maximum weight matching algorithm with approximation ratio 2, Theor. Comput. Sci, vol.412, issue.40, pp.5527-5540, 2011.

. Volker-turau, Self-stabilizing vertex cover in anonymous networks with optimal approximation ratio, Parallel Processing Letters, vol.20, issue.2, pp.173-186, 2010.

V. V. Vazirani, Approximation algorithms, 2001.