{"id":"https://openalex.org/W4411278191","doi":"https://doi.org/10.1145/3732772.3733547","title":"Nearly-Optimal Distributed Ruling Sets for Trees and high-girth graphs","display_name":"Nearly-Optimal Distributed Ruling Sets for Trees and high-girth graphs","publication_year":2025,"publication_date":"2025-06-13","ids":{"openalex":"https://openalex.org/W4411278191","doi":"https://doi.org/10.1145/3732772.3733547"},"language":"en","primary_location":{"id":"doi:10.1145/3732772.3733547","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3732772.3733547","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3732772.3733547","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3732772.3733547","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5118140996","display_name":"Malte Baumecker","orcid":null},"institutions":[{"id":"https://openalex.org/I4092182","display_name":"Graz University of Technology","ror":"https://ror.org/00d7xrm67","country_code":"AT","type":"education","lineage":["https://openalex.org/I4092182"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Malte Baumecker","raw_affiliation_strings":["Graz University of Technology, Graz, Austria"],"raw_orcid":"https://orcid.org/0009-0005-3582-4880","affiliations":[{"raw_affiliation_string":"Graz University of Technology, Graz, Austria","institution_ids":["https://openalex.org/I4092182"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083037622","display_name":"Yannic Maus","orcid":"https://orcid.org/0000-0003-4062-6991"},"institutions":[{"id":"https://openalex.org/I4092182","display_name":"Graz University of Technology","ror":"https://ror.org/00d7xrm67","country_code":"AT","type":"education","lineage":["https://openalex.org/I4092182"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Yannic Maus","raw_affiliation_strings":["Graz University of Technology, Graz, Austria"],"raw_orcid":"https://orcid.org/0000-0003-4062-6991","affiliations":[{"raw_affiliation_string":"Graz University of Technology, Graz, Austria","institution_ids":["https://openalex.org/I4092182"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064067007","display_name":"Jara Uitto","orcid":"https://orcid.org/0000-0002-5179-5056"},"institutions":[{"id":"https://openalex.org/I9927081","display_name":"Aalto University","ror":"https://ror.org/020hwjq30","country_code":"FI","type":"education","lineage":["https://openalex.org/I9927081"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Jara Uitto","raw_affiliation_strings":["Aalto University, Helsinki, Finland"],"raw_orcid":"https://orcid.org/0000-0002-5179-5056","affiliations":[{"raw_affiliation_string":"Aalto University, Helsinki, Finland","institution_ids":["https://openalex.org/I9927081"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.14680426,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"88","last_page":"98"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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.9973000288009644,"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/girth","display_name":"Girth (graph theory)","score":0.6387023329734802},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5778048038482666},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5626625418663025},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.43016746640205383},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.395489364862442},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3587349057197571},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3546137809753418}],"concepts":[{"id":"https://openalex.org/C2777434295","wikidata":"https://www.wikidata.org/wiki/Q959831","display_name":"Girth (graph theory)","level":2,"score":0.6387023329734802},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5778048038482666},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5626625418663025},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.43016746640205383},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.395489364862442},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3587349057197571},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3546137809753418}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3732772.3733547","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3732772.3733547","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3732772.3733547","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2504.21777","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2504.21777","pdf_url":"https://arxiv.org/pdf/2504.21777","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:aaltodoc.aalto.fi:123456789/138942","is_oa":true,"landing_page_url":"https://research.aalto.fi/en/publications/807cf3d1-3f16-44e2-ab23-5b21c375aab8","pdf_url":null,"source":{"id":"https://openalex.org/S4306401662","display_name":"Aaltodoc (Aalto University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I9927081","host_organization_name":"Aalto University","host_organization_lineage":["https://openalex.org/I9927081"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1145/3732772.3733547","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3732772.3733547","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3732772.3733547","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1249869842","display_name":"Local and Global Problems in Decentralized Computing","funder_award_id":"I6915","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"},{"id":"https://openalex.org/G1314959985","display_name":"Distributed Algorithms: The Role of Bandwidth Restrictions","funder_award_id":"P36280","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"}],"funders":[{"id":"https://openalex.org/F4320321181","display_name":"Austrian Science Fund","ror":"https://ror.org/013tf3c58"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4411278191.pdf","grobid_xml":"https://content.openalex.org/works/W4411278191.grobid-xml"},"referenced_works_count":29,"referenced_works":["https://openalex.org/W1957963525","https://openalex.org/W1964089073","https://openalex.org/W1970330908","https://openalex.org/W1983214236","https://openalex.org/W2013444956","https://openalex.org/W2022155283","https://openalex.org/W2023634316","https://openalex.org/W2054910423","https://openalex.org/W2074687256","https://openalex.org/W2100061495","https://openalex.org/W2119761906","https://openalex.org/W2467514673","https://openalex.org/W2963197483","https://openalex.org/W2963983116","https://openalex.org/W2964046371","https://openalex.org/W2983776960","https://openalex.org/W3017383812","https://openalex.org/W3126682399","https://openalex.org/W3174327139","https://openalex.org/W3210958954","https://openalex.org/W3211087014","https://openalex.org/W4210854863","https://openalex.org/W4286210571","https://openalex.org/W4316652332","https://openalex.org/W4380880097","https://openalex.org/W4385714774","https://openalex.org/W4399837809","https://openalex.org/W4404848279","https://openalex.org/W6947870285"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2903806635","https://openalex.org/W4353100660","https://openalex.org/W2311783135","https://openalex.org/W3194346534","https://openalex.org/W1902769386","https://openalex.org/W1501751563","https://openalex.org/W4296243762","https://openalex.org/W387599619","https://openalex.org/W2623803366"],"abstract_inverted_index":{"Given":[0],"a":[1,7,11,28,156],"graph":[2],"G":[3],"=":[4],"(V,":[5],"E),":[6],"\u03b2-ruling":[8],"set":[9],"is":[10,17],"subset":[12],"S":[13,31],"\u2286":[14],"V":[15,26],"that":[16,98,115],"i)":[18],"independent,":[19],"and":[20,50,154],"ii)":[21],"every":[22],"node":[23,29],"\u03c5":[24],"\u2208":[25],"has":[27],"of":[30,141],"within":[32],"distance":[33,159],"\u03b2.":[34,160],"In":[35],"this":[36],"paper":[37],"we":[38,63,96,113],"present":[39,64],"almost":[40,77],"optimal":[41],"distributed":[42],"algorithms":[43,153],"for":[44,71],"finding":[45],"ruling":[46],"sets":[47,74,100,120],"in":[48,54,104,109,124,129],"trees":[49],"high":[51],"girth":[52],"graphs":[53,131],"the":[55,79,133,150],"classic":[56],"LOCAL":[57],"model.":[58],"As":[59],"our":[60],"first":[61],"contribution":[62],"an":[65],"O(log":[66,116],"log":[67,82,84,85,106,117,118,126],"n)-round":[68],"randomized":[69],"algorithm":[70],"computing":[72],"2-ruling":[73,99],"on":[75,149],"trees,":[76],"matching":[78,132],"\u03a9":[80],"(log":[81],"n/log":[83],"n)":[86,107,127],"lower":[87,134],"bound":[88,135],"given":[89],"by":[90],"Balliu":[91],"et":[92],"al.":[93],"[FOCS'20].":[94],"Second,":[95],"show":[97,114],"can":[101,121],"be":[102,122],"solved":[103],"\u00d5(log5/3":[105],"rounds":[108,128],"high-girth":[110,130],"graphs.":[111],"Lastly,":[112],"n)-ruling":[119],"computed":[123],"\u00d5(log":[125],"up":[136],"to":[137],"triple-log":[138],"factors.":[139],"All":[140],"these":[142],"results":[143],"either":[144],"improve":[145],"polynomially":[146],"or":[147],"exponentially":[148],"previously":[151],"best":[152],"use":[155],"smaller":[157],"domination":[158]},"counts_by_year":[],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-06-14T00:00:00"}