{"id":"https://openalex.org/W2026210405","doi":"https://doi.org/10.1145/1073814.1073835","title":"Primal-dual based distributed algorithms for vertex cover with semi-hard capacities","display_name":"Primal-dual based distributed algorithms for vertex cover with semi-hard capacities","publication_year":2005,"publication_date":"2005-07-17","ids":{"openalex":"https://openalex.org/W2026210405","doi":"https://doi.org/10.1145/1073814.1073835","mag":"2026210405"},"language":"en","primary_location":{"id":"doi:10.1145/1073814.1073835","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1073814.1073835","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5034276567","display_name":"Fabrizio Grandoni","orcid":"https://orcid.org/0000-0002-9676-4931"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"F. Grandoni","raw_affiliation_strings":["Universit\u00e0 di Roma \"La Sapienza\", Roma, Italy","Universita' di Roma, La Sapienza, Roma, Italy#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e0 di Roma \"La Sapienza\", Roma, Italy","institution_ids":["https://openalex.org/I861853513"]},{"raw_affiliation_string":"Universita' di Roma, La Sapienza, Roma, Italy#TAB#","institution_ids":["https://openalex.org/I861853513"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111545821","display_name":"Jochen K\u00f6nemann","orcid":null},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"J. K\u00f6nemann","raw_affiliation_strings":["University of Waterloo, Waterloo, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Waterloo, Waterloo, Canada","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063633119","display_name":"Alessandro Panconesi","orcid":"https://orcid.org/0000-0002-2169-3067"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"A. Panconesi","raw_affiliation_strings":["Universit\u00e0 di Roma \"La Sapienza\", Roma, Italy","Universita' di Roma, La Sapienza, Roma, Italy#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e0 di Roma \"La Sapienza\", Roma, Italy","institution_ids":["https://openalex.org/I861853513"]},{"raw_affiliation_string":"Universita' di Roma, La Sapienza, Roma, Italy#TAB#","institution_ids":["https://openalex.org/I861853513"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5057257639","display_name":"Mauro Sozio","orcid":"https://orcid.org/0000-0002-2031-3974"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"M. Sozio","raw_affiliation_strings":["Universit\u00e0 di Roma \"La Sapienza\", Roma, Italy","Universita' di Roma, La Sapienza, Roma, Italy#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e0 di Roma \"La Sapienza\", Roma, Italy","institution_ids":["https://openalex.org/I861853513"]},{"raw_affiliation_string":"Universita' di Roma, La Sapienza, Roma, Italy#TAB#","institution_ids":["https://openalex.org/I861853513"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"25","issue":null,"first_page":"118","last_page":"125"},"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.9998000264167786,"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.9998000264167786,"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/T12288","display_name":"Optimization and Search Problems","score":0.9968000054359436,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9799000024795532,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.7743704915046692},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7311416268348694},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6553616523742676},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5812327861785889},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5727883577346802},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.5371603965759277},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.5264635682106018},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.49980688095092773},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.4833907186985016},{"id":"https://openalex.org/keywords/edge-cover","display_name":"Edge cover","score":0.48198360204696655},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.45763659477233887},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.45256099104881287},{"id":"https://openalex.org/keywords/feedback-vertex-set","display_name":"Feedback vertex set","score":0.43237021565437317},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.42652595043182373},{"id":"https://openalex.org/keywords/neighbourhood","display_name":"Neighbourhood (mathematics)","score":0.42071953415870667},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4065296947956085},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3709893226623535},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.27152812480926514}],"concepts":[{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.7743704915046692},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7311416268348694},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6553616523742676},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5812327861785889},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5727883577346802},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5371603965759277},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.5264635682106018},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.49980688095092773},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.4833907186985016},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.48198360204696655},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45763659477233887},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.45256099104881287},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.43237021565437317},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.42652595043182373},{"id":"https://openalex.org/C161677786","wikidata":"https://www.wikidata.org/wiki/Q2478475","display_name":"Neighbourhood (mathematics)","level":2,"score":0.42071953415870667},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4065296947956085},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3709893226623535},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.27152812480926514},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1073814.1073835","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1073814.1073835","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.135.6042","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.135.6042","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.uwaterloo.ca/~jochen/docs/capVC.pdf","raw_type":"text"},{"id":"pmh:oai:iris.uniroma1.it:11573/359816","is_oa":false,"landing_page_url":"http://hdl.handle.net/11573/359816","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/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1558145674","https://openalex.org/W1572977974","https://openalex.org/W1971749164","https://openalex.org/W1988837529","https://openalex.org/W2000869424","https://openalex.org/W2029483371","https://openalex.org/W2030726651","https://openalex.org/W2042626642","https://openalex.org/W2056050680","https://openalex.org/W2075857626","https://openalex.org/W2082903339","https://openalex.org/W2088188524","https://openalex.org/W2089074354","https://openalex.org/W2090222354","https://openalex.org/W2093320485","https://openalex.org/W2100061495","https://openalex.org/W2108073487","https://openalex.org/W2118288908","https://openalex.org/W2127622665","https://openalex.org/W2139841919","https://openalex.org/W2143996311","https://openalex.org/W2144416612","https://openalex.org/W2161973620","https://openalex.org/W2551034790","https://openalex.org/W2914598255","https://openalex.org/W3083234306","https://openalex.org/W6672819393"],"related_works":["https://openalex.org/W2156896570","https://openalex.org/W1566660502","https://openalex.org/W2079263399","https://openalex.org/W1558145674","https://openalex.org/W2544075308","https://openalex.org/W2025716666","https://openalex.org/W1963831867","https://openalex.org/W3029871987","https://openalex.org/W2167786517","https://openalex.org/W2037935057"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3,16,105],"consider":[4],"the":[5,75,95,127,135,168,173,180,211,222],"weighted,":[6],"capacitated":[7],"vertex":[8,27,55,82,117],"cover":[9,56,118],"problem":[10,113],"with":[11],"hard":[12],"capacities":[13],"(capVC).":[14],"Here,":[15],"are":[17],"given":[18,136],"an":[19],"undirected":[20],"graph":[21],"G":[22],"=":[23,177],"(V,":[24],"E),":[25],"non-negative":[26],"weightswtv":[28],"for":[29,40,111],"all":[30,41],"vertices":[31],"v":[32,42,83,146],"\u2208":[33,43,63,84,147],"V,":[34],"and":[35,74,175],"node-capacities":[36],"Bv":[37],"\u2265":[38],"1":[39],"V.":[44,59],"A":[45],"feasible":[46,132],"solution":[47,133],"to":[48,67,80,93,134,143,184,209],"a":[49,54,101,107,116,130,192,202,215,230,235],"givencapVC":[50],"instance":[51],"consists":[52],"of":[53,69,77,98,120,129,140,160,170,182,205,221],"C":[57,73,85,119,148],"\u2286":[58],"Each":[60],"edge":[61],"e":[62],"E":[64],"is":[65,86,92,126,149,163,167,179,189,207,224,227],"assigned":[66,79,142],"one":[68],"its":[70],"endpoints":[71],"in":[72,172,229],"number":[76,139,169,204],"edges":[78,141],"any":[81,144,196],"at":[87,122,150],"most":[88,123,151],"Bv.":[89,156],"The":[90,138,157,218],"goal":[91],"minimize":[94],"total":[96],"weight":[97,121,128],"C.":[99],"For":[100],"parameter":[102],"\u025b>":[103],"0":[104],"give":[106],"deterministic,":[108],"distributed":[109,197],"algorithm":[110,162,198,223],"thecapVC":[112],"that":[114,195,225],"computes":[115],"(2+\u025b)\u00b7opt":[124],"whereopt":[125],"minimumweight":[131],"instance.":[137],"node":[145],"(4":[152],"+":[153],"\u025b)":[154],"\u00b7":[155],"running":[158],"time":[159],"our":[161],"O(log(nW)/\u025b),":[164],"where":[165],"n":[166],"nodes":[171],"network":[174],"W":[176],"wtmax/wtmin":[178],"ratio":[181],"largest":[183],"smallest":[185],"weight.":[186],"This":[187],"result":[188],"complemented":[190],"by":[191,214],"lower-bound":[193],"saying":[194],"forcapVC":[199],"which":[200],"requires":[201],"poly-logarithmic":[203],"rounds":[206],"bound":[208],"violate":[210],"capacity":[212],"constraints":[213],"factor":[216],"two.":[217],"main":[219],"feature":[220],"it":[226],"derived":[228],"systematic":[231],"fashion":[232],"starting":[233],"from":[234],"primal-dual":[236],"sequential":[237],"algorithm.":[238]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}