{"id":"https://openalex.org/W2056399203","doi":"https://doi.org/10.1137/06065310x","title":"A Primal-Dual Bicriteria Distributed Algorithm for Capacitated Vertex Cover","display_name":"A Primal-Dual Bicriteria Distributed Algorithm for Capacitated Vertex Cover","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W2056399203","doi":"https://doi.org/10.1137/06065310x","mag":"2056399203"},"language":"en","primary_location":{"id":"doi:10.1137/06065310x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/06065310x","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/2108/31148","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5034276567","display_name":"Fabrizio Grandoni","orcid":"https://orcid.org/0000-0002-9676-4931"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"F. Grandoni","raw_affiliation_strings":["grandoni@disp.uniroma2.it#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"grandoni@disp.uniroma2.it#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111545821","display_name":"Jochen K\u00f6nemann","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"J. K\u00f6nemann","raw_affiliation_strings":["jochen@uwaterloo.ca#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"jochen@uwaterloo.ca#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063633119","display_name":"Alessandro Panconesi","orcid":"https://orcid.org/0000-0002-2169-3067"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"A. Panconesi","raw_affiliation_strings":["ale@di.uniroma1.it#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ale@di.uniroma1.it#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5057257639","display_name":"Mauro Sozio","orcid":"https://orcid.org/0000-0002-2031-3974"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"M. Sozio","raw_affiliation_strings":["msozio@mpi-inf.mpg.de#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"msozio@mpi-inf.mpg.de#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.857,"has_fulltext":false,"cited_by_count":30,"citation_normalized_percentile":{"value":0.9050496,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"38","issue":"3","first_page":"825","last_page":"840"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9941999912261963,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.7228822708129883},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5946921706199646},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.5615776181221008},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.561094343662262},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5471621155738831},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.5177851915359497},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.50639808177948},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.49088531732559204},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4356904923915863},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.43245330452919006},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.4238746166229248},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.32777440547943115},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.14629554748535156},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.1130477786064148}],"concepts":[{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.7228822708129883},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5946921706199646},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.5615776181221008},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.561094343662262},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5471621155738831},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.5177851915359497},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.50639808177948},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.49088531732559204},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4356904923915863},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.43245330452919006},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.4238746166229248},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.32777440547943115},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.14629554748535156},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.1130477786064148},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1137/06065310x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/06065310x","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:art.torvergata.it:2108/31148","is_oa":true,"landing_page_url":"http://hdl.handle.net/2108/31148","pdf_url":null,"source":{"id":"https://openalex.org/S4306400993","display_name":"Cineca Institutional Research Information System (Tor Vergata University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I116067653","host_organization_name":"University of Rome Tor Vergata","host_organization_lineage":["https://openalex.org/I116067653"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:edoc.mpg.de:428096","is_oa":false,"landing_page_url":"http://edoc.mpg.de/428096","pdf_url":null,"source":{"id":"https://openalex.org/S4406922265","display_name":"Max Planck Institute for Plasma Physics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Computing, v.38, 825-840 (2008)","raw_type":"Article"},{"id":"pmh:oai:iris.uniroma1.it:11573/361553","is_oa":false,"landing_page_url":"http://www.scopus.com/inward/record.url?eid=2-s2.0-55249104107&partnerID=65&md5=1ebf78d3070453d90dd97169525aea82","pdf_url":null,"source":{"id":"https://openalex.org/S4377196107","display_name":"IRIS Research product catalog (Sapienza University of Rome)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:pure.mpg.de:item_1324484","is_oa":false,"landing_page_url":"http://hdl.handle.net/11858/00-001M-0000-000F-1B0E-8","pdf_url":null,"source":{"id":"https://openalex.org/S4306400654","display_name":"MPG.PuRe (Max Planck Society)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149899117","host_organization_name":"Max Planck Society","host_organization_lineage":["https://openalex.org/I149899117"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Computing","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:art.torvergata.it:2108/31148","is_oa":true,"landing_page_url":"http://hdl.handle.net/2108/31148","pdf_url":null,"source":{"id":"https://openalex.org/S4306400993","display_name":"Cineca Institutional Research Information System (Tor Vergata University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I116067653","host_organization_name":"University of Rome Tor Vergata","host_organization_lineage":["https://openalex.org/I116067653"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W1519655831","https://openalex.org/W1572977974","https://openalex.org/W1970330908","https://openalex.org/W1971749164","https://openalex.org/W1988837529","https://openalex.org/W2003159902","https://openalex.org/W2029483371","https://openalex.org/W2029933769","https://openalex.org/W2030726651","https://openalex.org/W2051169745","https://openalex.org/W2054910423","https://openalex.org/W2056050680","https://openalex.org/W2059453880","https://openalex.org/W2075857626","https://openalex.org/W2082903339","https://openalex.org/W2088188524","https://openalex.org/W2090222354","https://openalex.org/W2093320485","https://openalex.org/W2100061495","https://openalex.org/W2108073487","https://openalex.org/W2112112676","https://openalex.org/W2118005842","https://openalex.org/W2118288908","https://openalex.org/W2120170057","https://openalex.org/W2126479983","https://openalex.org/W2127622665","https://openalex.org/W2143996311","https://openalex.org/W2144416612","https://openalex.org/W2152221184","https://openalex.org/W2161973620","https://openalex.org/W2165441947","https://openalex.org/W2172178473","https://openalex.org/W2551034790","https://openalex.org/W2694808592","https://openalex.org/W4232874415"],"related_works":["https://openalex.org/W2056597184","https://openalex.org/W1712180277","https://openalex.org/W1608414128","https://openalex.org/W2029933769","https://openalex.org/W2551034790","https://openalex.org/W2096382750","https://openalex.org/W2094388041","https://openalex.org/W3102280101","https://openalex.org/W2538178083","https://openalex.org/W159504299"],"abstract_inverted_index":{"In":[0],"this":[1,77,116,147],"paper":[2],"we":[3,67,110],"consider":[4],"the":[5,12,38,48,64,81,101,121,156,167],"capacitated":[6],"vertex":[7,15],"cover":[8,16,23],"problem,":[9],"which":[10,46,130],"is":[11,20,86,149],"variant":[13],"of":[14,27,54,60,107,115,141,155,163],"where":[17],"each":[18],"node":[19],"allowed":[21],"to":[22,136,151,159],"a":[24,43,52,57,94,105,112,138,153,160],"limited":[25],"number":[26,59,140,162],"edges.":[28],"We":[29,91,118],"present":[30,111],"an":[31,125],"efficient,":[32],"deterministic,":[33],"distributed":[34,73,113,134],"approximation":[35,74,168],"algorithm":[36,41,75,98,123],"for":[37,76,128],"problem.":[39],"Our":[40,84],"computes":[42],"$(2+\\epsilon)$-approximate":[44],"solution":[45],"violates":[47,100],"capacity":[49,82,102],"constraints":[50,103],"by":[51,104],"factor":[53,106],"$(4+\\epsilon)$":[55],"in":[56,88,146],"polylogarithmic":[58,161],"communication":[61,142,157],"rounds.":[62,143],"On":[63],"other":[65],"hand,":[66],"also":[68],"show":[69],"that":[70,99,120],"every":[71],"efficient":[72],"problem":[78],"must":[79],"violate":[80],"constraints.":[83],"result":[85],"achieved":[87],"two":[89],"steps.":[90],"first":[92],"develop":[93],"2-approximate,":[95],"sequential":[96,122],"primal-dual":[97],"2.":[108],"Subsequently,":[109],"version":[114],"algorithm.":[117],"demonstrate":[119],"has":[124],"inherent":[126],"need":[127],"synchronization":[129],"forces":[131],"any":[132],"naive":[133],"implementation":[135],"use":[137],"linear":[139],"The":[144],"challenge":[145],"step":[148],"therefore":[150],"achieve":[152],"reduction":[154],"complexity":[158],"rounds":[164],"without":[165],"worsening":[166],"guarantee.":[169]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}