{"id":"https://openalex.org/W2055000959","doi":"https://doi.org/10.1145/1435375.1435381","title":"Distributed weighted vertex cover via maximal matchings","display_name":"Distributed weighted vertex cover via maximal matchings","publication_year":2008,"publication_date":"2008-11-01","ids":{"openalex":"https://openalex.org/W2055000959","doi":"https://doi.org/10.1145/1435375.1435381","mag":"2055000959"},"language":"en","primary_location":{"id":"doi:10.1145/1435375.1435381","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1435375.1435381","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"type":"article","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/I116067653","display_name":"University of Rome Tor Vergata","ror":"https://ror.org/02p77k626","country_code":"IT","type":"education","lineage":["https://openalex.org/I116067653"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Fabrizio Grandoni","raw_affiliation_strings":["Universit\u00e0 di Roma Tor Vergata, Roma, Italy","Universita di Roma Tor Vergata, Roma, Italy#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e0 di Roma Tor Vergata, Roma, Italy","institution_ids":["https://openalex.org/I116067653"]},{"raw_affiliation_string":"Universita di Roma Tor Vergata, Roma, Italy#TAB#","institution_ids":["https://openalex.org/I116067653"]}]},{"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":"Jochen K\u00f6nemann","raw_affiliation_strings":["University of Waterloo, Waterloo, ON, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Waterloo, Waterloo, ON, Canada","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"last","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":"Alessandro Panconesi","raw_affiliation_strings":["Sapienza Universit\u00e0 di Roma, Roma, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Sapienza Universit\u00e0 di Roma, Roma, Italy","institution_ids":["https://openalex.org/I861853513"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.6732,"has_fulltext":false,"cited_by_count":38,"citation_normalized_percentile":{"value":0.92660739,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"5","issue":"1","first_page":"1","last_page":"12"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"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":1.0,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9980000257492065,"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.9977999925613403,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.7988283038139343},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7923243045806885},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6719843149185181},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6228326559066772},{"id":"https://openalex.org/keywords/feedback-vertex-set","display_name":"Feedback vertex set","score":0.5487369894981384},{"id":"https://openalex.org/keywords/edge-cover","display_name":"Edge cover","score":0.5453363060951233},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5186033248901367},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5129201412200928},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.4811307489871979},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.47551921010017395},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.4742164611816406},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.4422772526741028},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42755335569381714},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4107297360897064}],"concepts":[{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.7988283038139343},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7923243045806885},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6719843149185181},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6228326559066772},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.5487369894981384},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.5453363060951233},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5186033248901367},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5129201412200928},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.4811307489871979},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.47551921010017395},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.4742164611816406},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.4422772526741028},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42755335569381714},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4107297360897064},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"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":2,"locations":[{"id":"doi:10.1145/1435375.1435381","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1435375.1435381","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:iris.uniroma1.it:11573/362014","is_oa":false,"landing_page_url":"http://hdl.handle.net/11573/362014","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1519655831","https://openalex.org/W1964932074","https://openalex.org/W1971749164","https://openalex.org/W1999032440","https://openalex.org/W2003665833","https://openalex.org/W2006040238","https://openalex.org/W2011039300","https://openalex.org/W2011595776","https://openalex.org/W2028146521","https://openalex.org/W2029483371","https://openalex.org/W2038225707","https://openalex.org/W2041605864","https://openalex.org/W2064600658","https://openalex.org/W2077783414","https://openalex.org/W2088188524","https://openalex.org/W2752885492","https://openalex.org/W3145128584","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2156896570","https://openalex.org/W1566660502","https://openalex.org/W2544075308","https://openalex.org/W2025716666","https://openalex.org/W1963831867","https://openalex.org/W2024517697","https://openalex.org/W3029871987","https://openalex.org/W2167786517","https://openalex.org/W2056303072","https://openalex.org/W2037935057"],"abstract_inverted_index":{"In":[0],"this":[1,77,131],"article,":[2],"we":[3],"consider":[4],"the":[5,41,44,69,135],"problem":[6,78],"of":[7,36,46,56,130],"computing":[8,33],"a":[9,28,97,106,128],"minimum-weight":[10],"vertex-cover":[11,111],"in":[12,43,52,101,112],"an":[13,53],"n":[14,59,82,84],"-node,":[15],"weighted,":[16],"undirected":[17],"graph":[18],"G":[19,102,113],"=":[20],"(":[21],"V":[22],",":[23,103],"E":[24],").":[25],"We":[26],"present":[27],"fully":[29,94],"distributed":[30],"algorithm":[31,50,75,124],"for":[32,76],"vertex":[34],"covers":[35],"weight":[37],"at":[38,117],"most":[39],"twice":[40],"optimum,":[42],"case":[45],"integer":[47],"weights.":[48],"Our":[49,123],"runs":[51],"expected":[54],"number":[55],"O":[57,80],"(log":[58,81,83],"+":[60,85],"log":[61,86],"\u0174":[62,67,87],")":[63],"communication":[64],"rounds,":[65],"where":[66],"is":[68,92,105,125],"average":[70],"vertex-weight.":[71],"The":[72],"previous":[73],"best":[74],"requires":[79],"))":[88],"rounds":[89],"and":[90],"it":[91,104],"not":[93],"distributed.":[95],"For":[96],"maximal":[98],"matching":[99],"M":[100,120],"well-known":[107],"fact":[108],"that":[109],"any":[110],"needs":[114],"to":[115,134],"have":[116],"least":[118],"|":[119,121],"vertices.":[122],"based":[126],"on":[127],"generalization":[129],"combinatorial":[132],"lower-bound":[133],"weighted":[136],"setting.":[137]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}