{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T16:30:42Z","timestamp":1710261042932},"reference-count":9,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[2010,6]]},"abstract":"<jats:p> 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, \u0394<jats:sup>2<\/jats:sup>, \u0394 log <jats:sub>3<\/jats:sub> n}) rounds and requires O(\u0394) memory per node. <\/jats:p>","DOI":"10.1142\/s0129626410000132","type":"journal-article","created":{"date-parts":[[2010,7,20]],"date-time":"2010-07-20T07:43:12Z","timestamp":1279611792000},"page":"173-186","source":"Crossref","is-referenced-by-count":5,"title":["SELF-STABILIZING VERTEX COVER IN ANONYMOUS NETWORKS WITH OPTIMAL APPROXIMATION RATIO"],"prefix":"10.1142","volume":"20","author":[{"given":"VOLKER","family":"TURAU","sequence":"first","affiliation":[{"name":"Institute of Telematics, Hamburg University of Technology, Schwarzenbergstra\u00dfe 95, 21073 Hamburg, Germany"}]}],"member":"219","published-online":{"date-parts":[[2012,4,30]]},"reference":[{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90015-N"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2004.03.010"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1145\/502090.502098"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.12.022"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1145\/1435375.1435381"},{"key":"rf15","doi-asserted-by":"publisher","DOI":"10.1145\/4221.4227"},{"key":"rf16","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/6156.001.0001"},{"key":"rf17","doi-asserted-by":"publisher","DOI":"10.1007\/BF02278851"},{"key":"rf18","volume-title":"Approximation algorithms for NP-hard problems","author":"Hochbaum D. S.","year":"1997"}],"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626410000132","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T14:10:15Z","timestamp":1565100615000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626410000132"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6]]},"references-count":9,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2012,4,30]]},"published-print":{"date-parts":[[2010,6]]}},"alternative-id":["10.1142\/S0129626410000132"],"URL":"https:\/\/doi.org\/10.1142\/s0129626410000132","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,6]]}}}