{"id":"https://openalex.org/W2403340448","doi":"https://doi.org/10.1145/2933057.2933086","title":"A Distributed (2+\u03b5)-Approximation for Vertex Cover in O(log\u03b4/\u03b5 log log \u03b4) Rounds","display_name":"A Distributed (2+\u03b5)-Approximation for Vertex Cover in O(log\u03b4/\u03b5 log log \u03b4) Rounds","publication_year":2016,"publication_date":"2016-07-25","ids":{"openalex":"https://openalex.org/W2403340448","doi":"https://doi.org/10.1145/2933057.2933086","mag":"2403340448"},"language":"en","primary_location":{"id":"doi:10.1145/2933057.2933086","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2933057.2933086","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-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/A5019016353","display_name":"Reuven Bar-Yehuda","orcid":null},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Reuven Bar-Yehuda","raw_affiliation_strings":["Technion, Haifa, Israel"],"affiliations":[{"raw_affiliation_string":"Technion, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061279024","display_name":"Keren Censor-Hillel","orcid":"https://orcid.org/0000-0003-4395-5205"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Keren Censor-Hillel","raw_affiliation_strings":["Technion, Haifa, Israel"],"affiliations":[{"raw_affiliation_string":"Technion, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5067916743","display_name":"Gregory Schwartzman","orcid":"https://orcid.org/0000-0002-8461-1479"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Gregory Schwartzman","raw_affiliation_strings":["Technion, Haifa, Israel"],"affiliations":[{"raw_affiliation_string":"Technion, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5019016353"],"corresponding_institution_ids":["https://openalex.org/I174306211"],"apc_list":null,"apc_paid":null,"fwci":1.79713063,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.89614652,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"3","last_page":"8"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.9959999918937683,"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/binary-logarithm","display_name":"Binary logarithm","score":0.7782071828842163},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.7556741237640381},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6703396439552307},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.6564544439315796},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6291099786758423},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6208914518356323},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5686953663825989},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5305227041244507},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5079339146614075},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.5017848014831543},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.49498361349105835},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4435091018676758},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3597410023212433},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2086087465286255}],"concepts":[{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.7782071828842163},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.7556741237640381},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6703396439552307},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.6564544439315796},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6291099786758423},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6208914518356323},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5686953663825989},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5305227041244507},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5079339146614075},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.5017848014831543},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.49498361349105835},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4435091018676758},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3597410023212433},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2086087465286255},{"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/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","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},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2933057.2933086","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2933057.2933086","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W1507039213","https://openalex.org/W1572977974","https://openalex.org/W1813487646","https://openalex.org/W1970155114","https://openalex.org/W1998137177","https://openalex.org/W2006040238","https://openalex.org/W2011039300","https://openalex.org/W2011595776","https://openalex.org/W2013415302","https://openalex.org/W2029483371","https://openalex.org/W2044578110","https://openalex.org/W2055000959","https://openalex.org/W2056399203","https://openalex.org/W2064600658","https://openalex.org/W2088188524","https://openalex.org/W2101781054","https://openalex.org/W2116636970","https://openalex.org/W2137118456","https://openalex.org/W2161176300","https://openalex.org/W2165441947","https://openalex.org/W2179980496","https://openalex.org/W2401610261","https://openalex.org/W2952128674","https://openalex.org/W2953271509","https://openalex.org/W3023912806","https://openalex.org/W3149604617","https://openalex.org/W3183766709","https://openalex.org/W4246219036","https://openalex.org/W6764255843"],"related_works":["https://openalex.org/W2005615533","https://openalex.org/W4243665620","https://openalex.org/W1529311266","https://openalex.org/W2047234016","https://openalex.org/W2056597184","https://openalex.org/W1608733163","https://openalex.org/W2623150993","https://openalex.org/W2055932080","https://openalex.org/W2963158951","https://openalex.org/W2070751425"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,40,45],"simple":[3],"deterministic":[4],"distributed":[5],"(2+\u03b5)":[6],"approximation":[7,47],"algorithm":[8],"for":[9,29],"minimum":[10],"weight":[11],"vertex":[12],"cover,":[13],"which":[14,34,53],"completes":[15],"in":[16,26,48],"O(log\u03b4/\u03b5log":[17],"log\u03b4)":[18],"rounds,":[19,52],"where":[20],"\u03b4":[21],"is":[22,35],"the":[23,27,55],"maximum":[24],"degree":[25],"graph,":[28],"any":[30],"\u03b5":[31],">":[32],"0":[33],"at":[36],"most":[37],"O(1).":[38],"For":[39],"constant":[41,46],"\u03b5,":[42],"this":[43],"implies":[44],"Olog\u03b4/log":[49],"log":[50],"\u03b4)":[51],"contradicts":[54],"lower":[56],"bound":[57],"of":[58],"[KMW10].":[59]},"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}