{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T05:39:01Z","timestamp":1782970741694,"version":"3.54.5"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030013240","type":"print"},{"value":"9783030013257","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-01325-7_21","type":"book-chapter","created":{"date-parts":[[2018,10,30]],"date-time":"2018-10-30T17:43:05Z","timestamp":1540921385000},"page":"226-236","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A Deterministic Distributed 2-Approximation for Weighted Vertex Cover in $$O(\\log N\\log \\varDelta \/\\log ^2\\log \\varDelta )$$ Rounds"],"prefix":"10.1007","author":[{"given":"Ran","family":"Ben-Basat","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guy","family":"Even","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ken-ichi","family":"Kawarabayashi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gregory","family":"Schwartzman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,10,31]]},"reference":[{"key":"21_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-642-04355-0_21","volume-title":"Distributed Computing","author":"M \u00c5strand","year":"2009","unstructured":"\u00c5strand, M., Flor\u00e9en, P., Polishchuk, V., Rybicki, J., Suomela, J., Uitto, J.: A local 2-approximation algorithm for the vertex cover problem. In: Keidar, I. (ed.) DISC 2009. LNCS, vol. 5805, pp. 191\u2013205. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04355-0_21"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"\u00c5strand, M., Suomela, J.: Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks. In: SPAA 2010 Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, Thira, Santorini, Greece, pp. 294\u2013302, 13\u201315 June 2010","DOI":"10.1145\/1810479.1810533"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"Bar-Yehuda, R., Censor-Hillel, K., Schwartzman, G.: A distributed (2 + $$\\epsilon $$ )-approximation for vertex cover in o(log $$\\Delta $$ \/ $$\\epsilon $$ log log $$\\Delta $$ ) rounds. J. ACM 64(3), 23:1\u201323:11 (2017)","DOI":"10.1145\/3060294"},{"issue":"2","key":"21_CR4","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. J. Algorithms 2(2), 198\u2013203 (1981)","journal-title":"J. Algorithms"},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/S0304-0208(08)73101-3","volume":"109","author":"R Bar-Yehuda","year":"1985","unstructured":"Bar-Yehuda, R., Even, S.: A local-ratio theorem for approximating the weighted vertex cover problem. N.-Holland Math. Stud. 109, 27\u201345 (1985)","journal-title":"N.-Holland Math. Stud."},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Barenboim, L., Elkin, M., Pettie, S., Schneider, J.: The locality of distributed symmetry breaking. In: 53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2012, New Brunswick, NJ, USA, pp. 321\u2013330, 20\u201323 October 2012","DOI":"10.1109\/FOCS.2012.60"},{"key":"21_CR7","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd Edition. The MIT Press, Cambridge (2009)"},{"key":"21_CR8","unstructured":"Garey, M.R., Johnson, D.S., Freeman, W.H.: Computers and Intractability: A Guide to the Theory of NP-Completeness (1979)"},{"issue":"1","key":"21_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1435375.1435381","volume":"5","author":"Fabrizio Grandoni","year":"2008","unstructured":"Grandoni, F., K\u00f6nemann, J., Panconesi, A.: Distributed weighted vertex cover via maximal matchings. ACM Trans. Algorithms 5(1) (2008)","journal-title":"ACM Transactions on Algorithms"},{"issue":"1","key":"21_CR10","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1137\/S0895480100373121","volume":"15","author":"M Hanckowiak","year":"2001","unstructured":"Hanckowiak, M., Karonski, M., Panconesi, A.: On the distributed complexity of computing maximal matchings. SIAM J. Discrete Math. 15(1), 41\u201357 (2001)","journal-title":"SIAM J. Discrete Math."},{"issue":"3","key":"21_CR11","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1137\/0211045","volume":"11","author":"DS Hochbaum","year":"1982","unstructured":"Hochbaum, D.S.: Approximation algorithms for the set covering and vertex cover problems. SIAM J. Comput. 11(3), 555\u2013556 (1982)","journal-title":"SIAM J. Comput."},{"key":"21_CR12","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"Richard M. Karp","year":"1972","unstructured":"Karp, T.M.: Reducibility among combinatorial problems. In: Proceedings of a Symposium on the Complexity of Computer Computations. The IBM Thomas J. Watson Research Center, Yorktown Heights. Springer, New York, pp. 85\u2013103, 20\u201322 March 1972. https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9"},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Moscibroda, T., Wattenhofer, R.: The price of being near-sighted. In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, pp. 980\u2013989, 22\u201326 January 2006","DOI":"10.1145\/1109557.1109666"},{"issue":"2","key":"21_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2742012","volume":"63","author":"Fabian Kuhn","year":"2016","unstructured":"Kuhn, F., Moscibroda, T., Wattenhofer, R.: Local computation: lower and upper bounds. J. ACM 63(2), 17:1\u201317:44 (2016)","journal-title":"Journal of the ACM"},{"issue":"3","key":"21_CR15","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-epsilon. J. Comput. Syst. Sci. 74(3), 335\u2013349 (2008)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"21_CR16","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.E.: A primal-dual parallel approximation technique applied to weighted set and vertex covers. J. Algorithms 17(2), 280\u2013289 (1994)","journal-title":"J. Algorithms"},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"Koufogiannakis, C., Young, N.E.: Distributed and parallel algorithms for weighted vertex cover and other covering problems. In: Proceedings of the 28th ACM Symposium on Principles of Distributed Computing, PODC 2009, pp. 171\u2013179. ACM, New York (2009)","DOI":"10.1145\/1582716.1582746"},{"issue":"1","key":"21_CR18","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/s00446-011-0127-7","volume":"24","author":"C Koufogiannakis","year":"2011","unstructured":"Koufogiannakis, C., Young, N.E.: Distributed algorithms for covering, packing and maximum weighted matching. Distrib. Comput. 24(1), 45\u201363 (2011)","journal-title":"Distrib. Comput."},{"issue":"1","key":"21_CR19","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/BF01580444","volume":"8","author":"G. L. Nemhauser","year":"1975","unstructured":"Nemhauser, G.L., Trotter Jr., L.E.: Vertex packings: structural properties and algorithms. Math. Program. 8(1), 232\u2013248 (1975)","journal-title":"Mathematical Programming"},{"key":"21_CR20","unstructured":"Pettie, S.: Personal communication (2016)"},{"issue":"2","key":"21_CR21","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. Distrib. Comput. 14(2), 97\u2013100 (2001)","journal-title":"Distrib. Comput."},{"issue":"12","key":"21_CR22","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. Inf. Process. Lett. 109(12), 642\u2013645 (2009)","journal-title":"Inf. Process. Lett."},{"key":"21_CR23","unstructured":"Solomon, S.: Local algorithms for bounded degree sparsifiers in sparse graphs. In: ITCS, volume 94 of LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, pp. 52:1\u201352:19 (2018)"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-01325-7_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,29]],"date-time":"2019-10-29T22:30:20Z","timestamp":1572388220000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-01325-7_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030013240","9783030013257"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-01325-7_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"SIROCCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Structural Information and Communication Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ma'ale HaHamisha","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Israel","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sirocco2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/view\/sirocco2018","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"47","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"23","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"8","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"49% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"1.97","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}