{"id":"https://openalex.org/W7203869613","doi":"https://doi.org/10.4230/lipics.disc.2026.53","title":"Approximating Minimum Dominating Set with Few Awake Rounds","display_name":"Approximating Minimum Dominating Set with Few Awake Rounds","alternate_titles":[],"publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7203869613","doi":"https://doi.org/10.4230/lipics.disc.2026.53"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:28159","doi":null,"is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2026.53","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol397-disc2026/LIPIcs.DISC.2026.53/LIPIcs.DISC.2026.53.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"InProceedings"},"parent_works":[{"id":"https://openalex.org/W7225126586","display_name":"LIPIcs, Volume 397, DISC 2026, Complete Volume","relationship":"part"}],"lineage":["https://openalex.org/W7203869613","https://openalex.org/W7225126586"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol397-disc2026/LIPIcs.DISC.2026.53/LIPIcs.DISC.2026.53.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5093992717","display_name":"Hongyan Ji","orcid":"https://orcid.org/0000-0002-6610-844X","observed_orcids":["https://orcid.org/0000-0002-6610-844X"]},"institutions":[{"id":"https://openalex.org/I126307644","display_name":"University of Iowa","ror":"https://ror.org/036jqmy94","country_code":"US","type":"education","lineage":["https://openalex.org/I126307644"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ji, Hongyan","raw_affiliation_strings":["Department of Computer Science, University of Iowa, Iowa City, IA, USA"],"raw_orcid":"https://orcid.org/0000-0002-6610-844X","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Iowa, Iowa City, IA, USA","institution_ids":["https://openalex.org/I126307644"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5051339127","display_name":"Shreyas Pai","orcid":"https://orcid.org/0000-0003-2409-7807","observed_orcids":["https://orcid.org/0000-0003-2409-7807"]},"institutions":[{"id":"https://openalex.org/I24676775","display_name":"Indian Institute of Technology Madras","ror":"https://ror.org/03v0r5n49","country_code":"IN","type":"education","lineage":["https://openalex.org/I24676775"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Pai, Shreyas","raw_affiliation_strings":["Department of Computer Science and Engineering, IIT Madras, Chennai, India"],"raw_orcid":"https://orcid.org/0000-0003-2409-7807","affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, IIT Madras, Chennai, India","institution_ids":["https://openalex.org/I24676775"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5013414239","display_name":"Sriram V. Pemmaraju","orcid":"https://orcid.org/0000-0002-0834-3476","observed_orcids":["https://orcid.org/0000-0002-0834-3476"]},"institutions":[{"id":"https://openalex.org/I126307644","display_name":"University of Iowa","ror":"https://ror.org/036jqmy94","country_code":"US","type":"education","lineage":["https://openalex.org/I126307644"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Pemmaraju, Sriram V.","raw_affiliation_strings":["Department of Computer Science, University of Iowa, Iowa City, IA, USA"],"raw_orcid":"https://orcid.org/0000-0002-0834-3476","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Iowa, Iowa City, IA, USA","institution_ids":["https://openalex.org/I126307644"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.6457,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.75140987,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9945999979972839,"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.9945999979972839,"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.0012000000569969416,"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.0012000000569969416,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/minimum-dominating-set","display_name":"minimum dominating set","score":0.9909999966621399},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.7649999856948853},{"id":"https://openalex.org/keywords/distributed-graph-algorithms","display_name":"distributed graph algorithms","score":0.8180000185966492},{"id":"https://openalex.org/keywords/sampling-based-estimation","display_name":"sampling-based estimation","score":0.7770000100135803}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7067999839782715},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.7060999870300293},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6254000067710876},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5027999877929688},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.46869999170303345},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.44339999556541443},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43869999051094055},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.4131999909877777},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.35429999232292175},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.34040001034736633},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.3253999948501587},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.31769999861717224},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.3091000020503998},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2969000041484833},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.28619998693466187},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28130000829696655}],"mesh":[],"locations_count":4,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:28159","doi":null,"is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2026.53","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol397-disc2026/LIPIcs.DISC.2026.53/LIPIcs.DISC.2026.53.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"InProceedings"},{"id":"pmh:oai:arXiv.org:2608.19096","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2608.19096","pdf_url":"https://arxiv.org/pdf/2608.19096","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,"listed_in":[],"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":"doi:10.48550/arxiv.2608.19096","doi":"https://doi.org/10.48550/arxiv.2608.19096","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2608.19096","pdf_url":null,"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,"listed_in":[],"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":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},{"id":"doi:10.4230/lipics.disc.2026.53","doi":"https://doi.org/10.4230/lipics.disc.2026.53","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.disc.2026.53","pdf_url":null,"source":{"id":"https://openalex.org/S4393917817","display_name":"Leibniz international proceedings in informatics","issn_l":"1868-8969","issn":["1868-8969"],"is_oa":true,"is_in_doaj":true,"is_core":false,"listed_in":["doaj","jufo-1","norway-1"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:28159","doi":null,"is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2026.53","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol397-disc2026/LIPIcs.DISC.2026.53/LIPIcs.DISC.2026.53.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"InProceedings"},"sustainable_development_goals":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G5624203523","display_name":"Collaborative Research: AF: Medium: The Communication Cost of Distributed Computation","funder_award_id":"2402835","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G9001307422","display_name":"AF: Distributed Random Sampling","funder_award_id":"2617608","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7203869613.pdf","grobid_xml":"https://content.openalex.org/works/W7203869613.grobid-xml"},"referenced_works_count":24,"referenced_works":["https://openalex.org/W1957963525","https://openalex.org/W1988837529","https://openalex.org/W1991337804","https://openalex.org/W2044471216","https://openalex.org/W2078007422","https://openalex.org/W2127622665","https://openalex.org/W2144970024","https://openalex.org/W2157054705","https://openalex.org/W2555333713","https://openalex.org/W2694808592","https://openalex.org/W2786266143","https://openalex.org/W2963550269","https://openalex.org/W2982695726","https://openalex.org/W3046807936","https://openalex.org/W3210669820","https://openalex.org/W4248332043","https://openalex.org/W4285007266","https://openalex.org/W4380873944","https://openalex.org/W4380875778","https://openalex.org/W4398217618","https://openalex.org/W4399375901","https://openalex.org/W4409827988","https://openalex.org/W4411277271","https://openalex.org/W7167729383"],"related_works":["https://openalex.org/W2946618818","https://openalex.org/W1587504556","https://openalex.org/W3133065667","https://openalex.org/W3131549025","https://openalex.org/W3208963532","https://openalex.org/W6891559455","https://openalex.org/W2883955106","https://openalex.org/W2488232363","https://openalex.org/W2963962070","https://openalex.org/W7100393107"],"abstract_inverted_index":{"We":[0,120,144],"study":[1],"the":[2,9,22,58,76,79,114,122,147,153,169,199,255],"Minimum":[3],"Dominating":[4],"Set":[5],"(MDS)":[6],"problem":[7],"in":[8,26,32,54,94,137,168,179,181,222],"sleeping":[10,170,237],"Congest":[11,24,171,200,238],"model":[12,56,172,201],"(Chatterjee,":[13],"Gmyr,":[14],"and":[15,35,65,208,248],"Pandurangan,":[16],"PODC":[17],"2020),":[18],"a":[19,28,70,196,241],"generalization":[20,197,216],"of":[21,51,68,78,99,155,198,204,243],"standard":[23],"model,":[25],"which":[27],"node":[29,71],"may":[30],"sleep":[31],"some":[33],"rounds":[34,69,139,186,228],"can":[36,110,145],"only":[37],"compute,":[38],"send":[39],"messages,":[40],"or":[41],"receive":[42],"messages":[43],"when":[44],"it":[45],"is":[46,57,72,113],"awake.":[47],"The":[48],"awake":[49,73,104,108,132,142,148,190],"complexity":[50,109,149],"an":[52,166,175,218],"algorithm":[53,126,135,167,203],"this":[55,107],"worst":[59],"case":[60],"number":[61],"(over":[62],"all":[63,66,98],"inputs":[64],"nodes)":[67],"for":[74,90,127,159,229],"during":[75],"execution":[77],"algorithm.":[80,259],"While":[81],"there":[82],"are":[83],"several":[84],"O(log":[85,124],"\u0394)-approximation":[86,125],"algorithms":[87,239],"(in":[88],"expectation)":[89],"MDS":[91,128],"that":[92,116,173,212],"run":[93],"O(log\u00b2":[95],"\u0394)":[96,103,131,185,189,227],"rounds,":[97],"these":[100],"have":[101],"\u03a9(log\u00b2":[102],"complexity.":[105,143,191],"Whether":[106],"be":[111],"improved":[112],"question":[115],"drives":[117],"our":[118,134],"work.":[119],"present":[121],"first":[123],"with":[129,140,187],"o(log\u00b2":[130],"complexity;":[133],"runs":[136],"O(log\u00b2\u0394)":[138],"O\u0303(log\u0394)":[141],"reduce":[146],"further,":[150],"but":[151],"at":[152],"cost":[154],"approximation:":[156],"we":[157,213],"present,":[158],"any":[160],"1":[161,231],"<":[162,232],"\u03b1":[163],"\u2264":[164,234],"\u0394,":[165],"computes":[174,217],"O\u0303(\u03b1log\u0394)-approximate":[176],"dominating":[177,220],"set":[178,221],"expectation":[180],"O\u0303(log\u0394":[182],"\u22c5":[183,225],"log_\u03b1":[184],"O\u0303(log_\u03b1":[188],"Our":[192,236],"results":[193],"depend":[194],"on":[195],"SetCover":[202,258],"Grunau,":[205],"Mitrovi\u0107,":[206],"Rubinfeld,":[207],"Vakilian":[209],"(SODA":[210],"2020)":[211],"develop.":[214],"This":[215],"O(p\u22c5q\u22c5log_p\u0394)-approximate":[219],"O(log_p":[223],"\u0394":[224],"log_q":[226],"parameters":[230],"p,q":[233],"\u0394.":[235],"apply":[240],"variety":[242],"techniques":[244],"including":[245],"sampling-based":[246],"estimation":[247],"scheduling":[249],"using":[250],"virtual":[251],"binary":[252],"trees":[253],"to":[254],"aforementioned":[256],"2-parameter":[257]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W7203869613","counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-11-17T12:49:18.490984","created_date":"2026-08-22T00:00:00"}
