{"id":"https://openalex.org/W2963424691","doi":"https://doi.org/10.1145/3293611.3331577","title":"Optimal Distributed Covering Algorithms","display_name":"Optimal Distributed Covering Algorithms","publication_year":2019,"publication_date":"2019-07-16","ids":{"openalex":"https://openalex.org/W2963424691","doi":"https://doi.org/10.1145/3293611.3331577","mag":"2963424691"},"language":"en","primary_location":{"id":"doi:10.1145/3293611.3331577","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3293611.3331577","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2019 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/A5000201729","display_name":"Ran Ben Basat","orcid":"https://orcid.org/0000-0003-0196-9190"},"institutions":[{"id":"https://openalex.org/I2801851002","display_name":"Harvard University Press","ror":"https://ror.org/006v7bf86","country_code":"US","type":"other","lineage":["https://openalex.org/I136199984","https://openalex.org/I2801851002"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ran Ben Basat","raw_affiliation_strings":["Harvard University, Cambridge, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Harvard University, Cambridge, MA, USA","institution_ids":["https://openalex.org/I2801851002"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5064059676","display_name":"Guy Even","orcid":"https://orcid.org/0000-0001-5407-330X"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Guy Even","raw_affiliation_strings":["Tel Aviv University, Tel Aviv, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5008961593","display_name":"Ken\u2010ichi Kawarabayashi","orcid":"https://orcid.org/0000-0001-6056-4287"},"institutions":[{"id":"https://openalex.org/I184597095","display_name":"National Institute of Informatics","ror":"https://ror.org/04ksd4g47","country_code":"JP","type":"facility","lineage":["https://openalex.org/I1319490839","https://openalex.org/I184597095","https://openalex.org/I4210158934"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Ken-ichi Kawarabayashi","raw_affiliation_strings":["National Institute of Informatics, Tokyo, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National Institute of Informatics, Tokyo, Japan","institution_ids":["https://openalex.org/I184597095"]}]},{"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/I184597095","display_name":"National Institute of Informatics","ror":"https://ror.org/04ksd4g47","country_code":"JP","type":"facility","lineage":["https://openalex.org/I1319490839","https://openalex.org/I184597095","https://openalex.org/I4210158934"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Gregory Schwartzman","raw_affiliation_strings":["National Institute of Informatics, Tokyo, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National Institute of Informatics, Tokyo, Japan","institution_ids":["https://openalex.org/I184597095"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6258,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.60996963,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"104","last_page":"106"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9972000122070312,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9965999722480774,"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/hypergraph","display_name":"Hypergraph","score":0.7832923531532288},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.7412840723991394},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6738599538803101},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5690557956695557},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5353821516036987},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5077136754989624},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5039476752281189},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.500821590423584},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4982624053955078},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.48493054509162903},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.4711647927761078},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.4115154445171356},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4107918441295624},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3861047625541687},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.37962451577186584},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.16754430532455444}],"concepts":[{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.7832923531532288},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.7412840723991394},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6738599538803101},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5690557956695557},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5353821516036987},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5077136754989624},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5039476752281189},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.500821590423584},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4982624053955078},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.48493054509162903},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.4711647927761078},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.4115154445171356},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4107918441295624},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3861047625541687},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.37962451577186584},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.16754430532455444},{"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/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},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3293611.3331577","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3293611.3331577","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},{"id":"mag:2918001250","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G8230891464","display_name":"Large Graphs: Theory and Algorithms","funder_award_id":"18H05291","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"}],"funders":[{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1666479227","https://openalex.org/W1957963525","https://openalex.org/W1970155114","https://openalex.org/W1998137177","https://openalex.org/W2006040238","https://openalex.org/W2029483371","https://openalex.org/W2055000959","https://openalex.org/W2088188524","https://openalex.org/W2101781054","https://openalex.org/W2116636970","https://openalex.org/W2401610261","https://openalex.org/W2470787773","https://openalex.org/W2534944111","https://openalex.org/W2626058046","https://openalex.org/W2738712979","https://openalex.org/W2799259092","https://openalex.org/W2899153618","https://openalex.org/W2918001250","https://openalex.org/W2949268223","https://openalex.org/W2953390354","https://openalex.org/W2963424691","https://openalex.org/W2963800445","https://openalex.org/W4248332043"],"related_works":["https://openalex.org/W2100782222","https://openalex.org/W2115404728","https://openalex.org/W1963831867","https://openalex.org/W2025716666","https://openalex.org/W2921542279","https://openalex.org/W1981202693","https://openalex.org/W2077261354","https://openalex.org/W2903563585","https://openalex.org/W3029871987","https://openalex.org/W2145492278"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,9],"time-optimal":[3],"deterministic":[4],"distributed":[5,87,118],"algorithm":[6,46,61,88],"for":[7,74,89],"approximating":[8],"minimum":[10],"weight":[11],"vertex":[12,100],"cover":[13],"in":[14,30,57,63],"hypergraphs":[15],"of":[16,34,44,105,115],"rank":[17],"\u0192.":[18,40],"This":[19,83],"problem":[20,29,91],"is":[21,37,47,84],"equivalent":[22],"to":[23,111],"the":[24,32,54,58,64,85,99,103,112],"Minimum":[25],"Weight":[26],"Set":[27],"Cover":[28],"which":[31],"frequency":[33],"every":[35],"element":[36],"bounded":[38],"by":[39],"The":[41],"approximation":[42],"factor":[43],"our":[45],"(\u0192":[48],"+":[49],"\u03b5).":[50],"Let":[51],"\u0394":[52],"denote":[53],"maximum":[55],"degree":[56],"hypergraph.":[59],"Our":[60],"runs":[62],"CONGEST":[65],"model":[66],"and":[67,79],"requires":[68],"O(log":[69],"\u0394/log":[70],"log":[71],"\u0394)":[72],"rounds,":[73],"constants":[75],"\u03b5":[76],"\u2208":[77,81],"(0,1]":[78],"\u0192":[80],"N+.":[82],"first":[86],"this":[90],"whose":[92],"running":[93],"time":[94],"does":[95],"not":[96],"depend":[97],"on":[98],"weights":[101],"nor":[102],"number":[104],"vertices.":[106],"Thus":[107],"adding":[108],"another":[109],"member":[110],"exclusive":[113],"family":[114],"emphprovably":[116],"optimal":[117],"algorithms.":[119]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}