World Scientific
  • Search
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×
Our website is made possible by displaying certain online content using javascript.
In order to view the full content, please disable your ad blocker or whitelist our website www.worldscientific.com.

System Upgrade on Tue, Oct 25th, 2022 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at [email protected] for any enquiries.

SELF-STABILIZING VERTEX COVER IN ANONYMOUS NETWORKS WITH OPTIMAL APPROXIMATION RATIO

    This paper presents a deterministic self-stabilizing algorithm that approximates a minimum vertex cover in anonymous networks with ratio 2 using the distributed scheduler and the link-register model with composite atomicity. No algorithm with a better approximation ratio can exist. The algorithm stabilizes in O(min{n, Δ2, Δ log3 n}) rounds and requires O(Δ) memory per node.

    References

    • D. Angluin, Local and global properties in networks of processors, STOC '80: 12th An. ACM Symp. on Theory of Computing (ACM, New York, 1980) pp. 82–93. Google Scholar
    • S. K. Shukla, D. J. Rosenkrantz and S. S. Ravi, Observations on self-stabilizing graph algorithms for anonymous networks, 2nd Workshop on Self-Stabilizing Systems (1995) pp. 7.1–7.15. Google Scholar
    • W. Goddard, S. T. Hedetniemi and Z. Shi, An anonymous self-stabilizing algorithm for 1-maximal matching in trees, PDPTA, ed. H. R. Arabnia (CSREA Press, 2006) pp. 797–803. Google Scholar
    • S.-C. Hsu and S.-T. Huang, Inf. Process. Lett. 43(2), 77 (1992), DOI: 10.1016/0020-0190(92)90015-N. Crossref, ISIGoogle Scholar
    • Z. Shi, W. Goddard and S. T. Hedetniemi, Inf. Process. Lett. 91(2), 77 (2004), DOI: 10.1016/j.ipl.2004.03.010. Crossref, ISIGoogle Scholar
    • J. Håstad, J. ACM 48(4), 798 (2001), DOI: 10.1016/j.ipl.2004.03.010. Crossref, ISIGoogle Scholar
    • M. Hańćkowiak, M. Karoński and A. Panconesi, On the distributed complexity of computing maximal matchings, SODA '98: 9th An. ACM-SIAM Symp. on Discrete Algorithms (Philadelphia, 1998) pp. 219–225. Google Scholar
    • S. Chattopadhyay, L. Higham and K. Seyffarth, Dynamic and self-stabilizing distributed matching, 21st An. Symp. on Principles of distributed computing (ACM, New York, 2002) pp. 290–297. Google Scholar
    • F. Manneet al., Theo. Comp. Science 410(14), 1336 (2009), DOI: 10.1016/j.tcs.2008.12.022. Crossref, ISIGoogle Scholar
    • J. Kiniwa. Approximation of self-stabilizing vertex cover less than 2. In T. Herman and S. Tixeuil, editors, Self-Stabilizing Systems, volume 3764 of LNCS, pp. 171–182. Springer, 2005 . Google Scholar
    • F. Kuhn, T. Moscibroda and R. Wattenhofer, What cannot be computed locally!, PODC '2004: 23rd An. ACM Symp. on Principles of Distributed Computing (New York, 2004) pp. 300–309. Google Scholar
    • F. Grandoni, J. Könemann and A. Panconesi, ACM Trans. Algorithms 5(1), 1 (2008), DOI: 10.1145/1435375.1435381. Crossref, ISIGoogle Scholar
    • V.   Turau and B.   Hauck , A self-stabilizing approximation algorithm for vertex cover in anonymous networks , SSS 2009: 11th Int. Symp. on Stabilization, Safety, and Security of Distributed Systems . Google Scholar
    • V.   Polishchuk et al. , A local 2-approximation algorithm for the vertex cover problem , 23rd Int. Symp. on Distributed Computing (DISC) . Google Scholar
    • B. Awerbuch, J. ACM 32(4), 804 (1985), DOI: 10.1145/4221.4227. Crossref, ISIGoogle Scholar
    • S.   Dolev , Self-Stabilization ( MIT Press , Cambridge, USA , 2000 ) . CrossrefGoogle Scholar
    • S. Dolev and A. Israeli, Distrib. Comput. 7(1), 3 (1993), DOI: 10.1007/BF02278851. Crossref, ISIGoogle Scholar
    • D. S.   Hochbaum (ed.) , Approximation algorithms for NP-hard problems ( PWS Publishing Co. , Boston, USA , 1997 ) . Google Scholar