{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T20:52:52Z","timestamp":1762807972118,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642043543"},{"type":"electronic","value":"9783642043550"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04355-0_21","type":"book-chapter","created":{"date-parts":[[2009,9,22]],"date-time":"2009-09-22T22:44:15Z","timestamp":1253659455000},"page":"191-205","source":"Crossref","is-referenced-by-count":17,"title":["A Local 2-Approximation Algorithm for the Vertex Cover Problem"],"prefix":"10.1007","author":[{"given":"Matti","family":"\u00c5strand","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patrik","family":"Flor\u00e9en","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Valentin","family":"Polishchuk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joel","family":"Rybicki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jukka","family":"Suomela","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jara","family":"Uitto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R.M. Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum Press, New York (1972)"},{"key":"21_CR2","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1979)"},{"issue":"3","key":"21_CR3","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/j.jcss.2007.06.019","volume":"74","author":"S. Khot","year":"2008","unstructured":"Khot, S., Regev, O.: Vertex cover might be hard to approximate to within 2\u2009\u2212\u2009\u03b5. Journal of Computer and System Sciences\u00a074(3), 335\u2013349 (2008)","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"21_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1435375.1435381","volume":"5","author":"F. Grandoni","year":"2008","unstructured":"Grandoni, F., K\u00f6nemann, J., Panconesi, A.: Distributed weighted vertex cover via maximal matchings. ACM Transactions on Algorithms\u00a05(1), 1\u201312 (2008)","journal-title":"ACM Transactions on Algorithms"},{"issue":"1","key":"21_CR5","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1137\/S0895480100373121","volume":"15","author":"M. Ha\u0144\u0107kowiak","year":"2001","unstructured":"Ha\u0144\u0107kowiak, M., Karo\u0144ski, M., Panconesi, A.: On the distributed complexity of computing maximal matchings. SIAM Journal on Discrete Mathematics\u00a015(1), 41\u201357 (2001)","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"2","key":"21_CR6","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/PL00008932","volume":"14","author":"A. Panconesi","year":"2001","unstructured":"Panconesi, A., Rizzi, R.: Some simple distributed algorithms for sparse networks. Distributed Computing\u00a014(2), 97\u2013100 (2001)","journal-title":"Distributed Computing"},{"issue":"1","key":"21_CR7","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1137\/0221015","volume":"21","author":"N. Linial","year":"1992","unstructured":"Linial, N.: Locality in distributed graph algorithms. SIAM Journal on Computing\u00a021(1), 193\u2013201 (1992)","journal-title":"SIAM Journal on Computing"},{"issue":"6","key":"21_CR8","doi-asserted-by":"publisher","first-page":"1259","DOI":"10.1137\/S0097539793254571","volume":"24","author":"M. Naor","year":"1995","unstructured":"Naor, M., Stockmeyer, L.: What can be computed locally? SIAM Journal on Computing\u00a024(6), 1259\u20131277 (1995)","journal-title":"SIAM Journal on Computing"},{"unstructured":"Suomela, J.: Survey of local algorithms (2009, manuscript), \n                    \n                      http:\/\/www.iki.fi\/jukka.suomela\/local-survey","key":"21_CR9"},{"key":"21_CR10","first-page":"300","volume-title":"Proc. 23rd Symposium on Principles of Distributed Computing (PODC)","author":"F. Kuhn","year":"2004","unstructured":"Kuhn, F., Moscibroda, T., Wattenhofer, R.: What cannot be computed locally! In: Proc. 23rd Symposium on Principles of Distributed Computing (PODC), pp. 300\u2013309. ACM Press, New York (2004)"},{"key":"21_CR11","first-page":"980","volume-title":"Proc. 17th Symposium on Discrete Algorithms (SODA)","author":"F. Kuhn","year":"2006","unstructured":"Kuhn, F., Moscibroda, T., Wattenhofer, R.: The price of being near-sighted. In: Proc. 17th Symposium on Discrete Algorithms (SODA), pp. 980\u2013989. ACM Press, New York (2006)"},{"issue":"3","key":"21_CR12","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1137\/0211045","volume":"11","author":"D.S. Hochbaum","year":"1982","unstructured":"Hochbaum, D.S.: Approximation algorithms for the set covering and vertex cover problems. SIAM Journal on Computing\u00a011(3), 555\u2013556 (1982)","journal-title":"SIAM Journal on Computing"},{"unstructured":"Moscibroda, T.: Locality, Scheduling, and Selfishness: Algorithmic Foundations of Highly Decentralized Networks. PhD thesis, ETH Z\u00fcrich (2006)","key":"21_CR13"},{"issue":"12","key":"21_CR14","doi-asserted-by":"publisher","first-page":"642","DOI":"10.1016\/j.ipl.2009.02.017","volume":"109","author":"V. Polishchuk","year":"2009","unstructured":"Polishchuk, V., Suomela, J.: A simple local 3-approximation algorithm for vertex cover. Information Processing Letters\u00a0109(12), 642\u2013645 (2009)","journal-title":"Information Processing Letters"},{"key":"21_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-540-87779-0_6","volume-title":"Distributed Computing","author":"A. Czygrinow","year":"2008","unstructured":"Czygrinow, A., Ha\u0144\u0107kowiak, M., Wawrzyniak, W.: Fast distributed approximations in planar graphs. In: Taubenfeld, G. (ed.) DISC 2008. LNCS, vol.\u00a05218, pp. 78\u201392. Springer, Heidelberg (2008)"},{"key":"21_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1007\/978-3-540-87779-0_27","volume-title":"Distributed Computing","author":"C. Lenzen","year":"2008","unstructured":"Lenzen, C., Wattenhofer, R.: Leveraging Linial\u2019s locality limit. In: Taubenfeld, G. (ed.) DISC 2008. LNCS, vol.\u00a05218, pp. 394\u2013407. Springer, Heidelberg (2008)"},{"key":"21_CR17","first-page":"258","volume-title":"Proc. 32nd Symposium on Foundations of Computer Science (FOCS)","author":"B. Awerbuch","year":"1991","unstructured":"Awerbuch, B., Varghese, G.: Distributed program checking: a paradigm for building self-stabilizing distributed protocols. In: Proc. 32nd Symposium on Foundations of Computer Science (FOCS), pp. 258\u2013267. IEEE Computer Society Press, Los Alamitos (1991)"},{"issue":"2","key":"21_CR18","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1016\/0196-6774(81)90020-1","volume":"2","author":"R. Bar-Yehuda","year":"1981","unstructured":"Bar-Yehuda, R., Even, S.: A linear-time approximation algorithm for the weighted vertex cover problem. Journal of Algorithms\u00a02(2), 198\u2013203 (1981)","journal-title":"Journal of Algorithms"},{"key":"21_CR19","volume-title":"Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties","author":"G. Ausiello","year":"2003","unstructured":"Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer, Heidelberg (2003)"},{"key":"21_CR20","volume-title":"Approximation Algorithms","author":"V.V. Vazirani","year":"2001","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg (2001)"},{"key":"21_CR21","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"C.H. Papadimitriou","year":"1998","unstructured":"Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Dover Publications, New York (1998)"},{"issue":"3","key":"21_CR22","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0020-0190(95)00022-5","volume":"54","author":"T.F. Gonzalez","year":"1995","unstructured":"Gonzalez, T.F.: A simple LP-free approximation algorithm for the minimum weight vertex cover problem. Information Processing Letters\u00a054(3), 129\u2013131 (1995)","journal-title":"Information Processing Letters"},{"issue":"2","key":"21_CR23","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1006\/jagm.1994.1036","volume":"17","author":"S. Khuller","year":"1994","unstructured":"Khuller, S., Vishkin, U., Young, N.: A primal-dual parallel approximation technique applied to weighted set and vertex covers. Journal of Algorithms\u00a017(2), 280\u2013289 (1994)","journal-title":"Journal of Algorithms"},{"key":"21_CR24","first-page":"219","volume-title":"Proc. 9th Symposium on Discrete Algorithms (SODA)","author":"M. Ha\u0144\u0107kowiak","year":"1998","unstructured":"Ha\u0144\u0107kowiak, M., Karo\u0144ski, M., Panconesi, A.: On the distributed complexity of computing maximal matchings. In: Proc. 9th Symposium on Discrete Algorithms (SODA), pp. 219\u2013225. SIAM, Philadelphia (1998)"},{"key":"21_CR25","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1112\/plms\/s2-30.1.264","volume":"30","author":"F.P. Ramsey","year":"1930","unstructured":"Ramsey, F.P.: On a problem of formal logic. Proceedings of the London Mathematical Society\u00a030, 264\u2013286 (1930)","journal-title":"Proceedings of the London Mathematical Society"},{"key":"21_CR26","volume-title":"Proc. 21st Symposium on Parallelism in Algorithms and Architectures (SPAA)","author":"P. Flor\u00e9en","year":"2009","unstructured":"Flor\u00e9en, P., Kaasinen, J., Kaski, P., Suomela, J.: An optimal local approximation algorithm for max-min linear programs. In: Proc. 21st Symposium on Parallelism in Algorithms and Architectures (SPAA). ACM Press, New York (2009)"},{"key":"21_CR27","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1109\/ISTCS.1995.377023","volume-title":"Proc. 3rd Israel Symposium on the Theory of Computing and Systems (ISTCS 1995)","author":"A. Mayer","year":"1995","unstructured":"Mayer, A., Naor, M., Stockmeyer, L.: Local computations on static and dynamic graphs. In: Proc. 3rd Israel Symposium on the Theory of Computing and Systems (ISTCS 1995), pp. 268\u2013278. IEEE Computer Society Press, Los Alamitos (1995)"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04355-0_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T17:53:46Z","timestamp":1552154026000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04355-0_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642043543","9783642043550"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04355-0_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}