{"id":"https://openalex.org/W4286503989","doi":"https://doi.org/10.1145/3519270.3538437","title":"Near-Optimal Distributed Dominating Set in Bounded Arboricity Graphs","display_name":"Near-Optimal Distributed Dominating Set in Bounded Arboricity Graphs","publication_year":2022,"publication_date":"2022-07-20","ids":{"openalex":"https://openalex.org/W4286503989","doi":"https://doi.org/10.1145/3519270.3538437"},"language":"en","primary_location":{"id":"doi:10.1145/3519270.3538437","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3519270.3538437","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2022 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/A5052412504","display_name":"Michal Dory","orcid":"https://orcid.org/0000-0002-8565-9642"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Michal Dory","raw_affiliation_strings":["ETH Zurich, Zurich, Switzerland"],"affiliations":[{"raw_affiliation_string":"ETH Zurich, Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088284921","display_name":"Mohsen Ghaffari","orcid":"https://orcid.org/0000-0002-1939-9053"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Mohsen Ghaffari","raw_affiliation_strings":["ETH Zurich, Zurich, Switzerland"],"affiliations":[{"raw_affiliation_string":"ETH Zurich, Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080199624","display_name":"Saeed Ilchi","orcid":null},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Saeed Ilchi","raw_affiliation_strings":["ETH Zurich, Zurich, Switzerland"],"affiliations":[{"raw_affiliation_string":"ETH Zurich, Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5052412504"],"corresponding_institution_ids":["https://openalex.org/I35440088"],"apc_list":null,"apc_paid":null,"fwci":0.2922,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.57756734,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"18","issue":null,"first_page":"292","last_page":"300"},"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.9997000098228455,"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.9997000098228455,"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/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.9980000257492065,"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/T10237","display_name":"Cryptography and Data Security","score":0.9922000169754028,"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/arboricity","display_name":"Arboricity","score":0.9812519550323486},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.7210237979888916},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.696811854839325},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6572937965393066},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6357824802398682},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.591606616973877},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5648782849311829},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.5499564409255981},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5104566812515259},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5095643997192383},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.45866265892982483},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.43776601552963257},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.43623852729797363},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.4241056740283966},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4125676155090332},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3177555501461029},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2591155767440796},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.18781021237373352},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.18573206663131714},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.18271586298942566}],"concepts":[{"id":"https://openalex.org/C83204008","wikidata":"https://www.wikidata.org/wiki/Q4784907","display_name":"Arboricity","level":4,"score":0.9812519550323486},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.7210237979888916},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.696811854839325},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6572937965393066},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6357824802398682},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.591606616973877},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5648782849311829},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.5499564409255981},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5104566812515259},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5095643997192383},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.45866265892982483},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.43776601552963257},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.43623852729797363},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.4241056740283966},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4125676155090332},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3177555501461029},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2591155767440796},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.18781021237373352},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.18573206663131714},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.18271586298942566},{"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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","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/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3519270.3538437","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3519270.3538437","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1556283916","display_name":null,"funder_award_id":"853109","funder_id":"https://openalex.org/F4320334678","funder_display_name":"European Research Council"}],"funders":[{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1523755288","https://openalex.org/W1869515244","https://openalex.org/W1957963525","https://openalex.org/W2040924621","https://openalex.org/W2044471216","https://openalex.org/W2077158870","https://openalex.org/W2078400655","https://openalex.org/W2589200750","https://openalex.org/W2962735094","https://openalex.org/W2963158951","https://openalex.org/W2963296241","https://openalex.org/W2963948964","https://openalex.org/W3012533071","https://openalex.org/W3015191696","https://openalex.org/W3083234306","https://openalex.org/W3175327569"],"related_works":["https://openalex.org/W300018836","https://openalex.org/W2359923140","https://openalex.org/W3037291746","https://openalex.org/W3164644441","https://openalex.org/W2906881967","https://openalex.org/W2935770235","https://openalex.org/W2991587872","https://openalex.org/W3004945501","https://openalex.org/W3118753906","https://openalex.org/W2561239406"],"abstract_inverted_index":{"We":[0,36],"describe":[1],"a":[2,39,56],"simple":[3],"deterministic":[4],"O(\u03b5-1":[5],"log":[6],"\u0394)":[7],"round":[8,45],"distributed":[9,65],"algorithm":[10],"for":[11,51],"(2\u03b1+":[12],"1)":[13],"(1":[14],"+":[15],"\u03b5)":[16],"approximation":[17,68],"of":[18],"minimum":[19],"weighted":[20],"dominating":[21],"set":[22],"on":[23,64],"graphs":[24],"with":[25],"arboricity":[26],"at":[27],"most":[28],"\u03b1.":[29],"Here":[30],"\u0394":[31],"denotes":[32],"the":[33,52,59],"maximum":[34],"degree.":[35],"also":[37],"show":[38],"lower":[40,62],"bound":[41,63],"proving":[42],"that":[43],"this":[44],"complexity":[46],"is":[47],"nearly":[48],"optimal":[49],"even":[50],"unweighted":[53],"case,":[54],"via":[55],"reduction":[57],"from":[58],"celebrated":[60],"KMW":[61],"vertex":[66],"cover":[67],"[Kuhn,":[69],"Moscibroda,":[70],"and":[71],"Wattenhofer":[72],"JACM'16].":[73]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}