{"id":"https://openalex.org/W4416191564","doi":"https://doi.org/10.1145/3798129.3800805","title":"Fully Dynamic Set Cover: Worst-Case Recourse and Update Time","display_name":"Fully Dynamic Set Cover: Worst-Case Recourse and Update Time","publication_year":2026,"publication_date":"2026-06-09","ids":{"openalex":"https://openalex.org/W4416191564","doi":"https://doi.org/10.1145/3798129.3800805"},"language":null,"primary_location":{"id":"doi:10.1145/3798129.3800805","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800805","pdf_url":null,"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 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1145/3798129.3800805","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5103251160","display_name":"Sayan Bhattacharya","orcid":"https://orcid.org/0000-0003-1612-0296"},"institutions":[{"id":"https://openalex.org/I39555362","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86","country_code":"GB","type":"education","lineage":["https://openalex.org/I39555362"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Sayan Bhattacharya","raw_affiliation_strings":["University of Warwick, Coventry, United Kingdom"],"raw_orcid":"https://orcid.org/0000-0003-1612-0296","affiliations":[{"raw_affiliation_string":"University of Warwick, Coventry, United Kingdom","institution_ids":["https://openalex.org/I39555362"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055374197","display_name":"Ruoxu Cen","orcid":"https://orcid.org/0009-0007-3900-2344"},"institutions":[{"id":"https://openalex.org/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ruoxu Cen","raw_affiliation_strings":["Duke University, Durham, USA"],"raw_orcid":"https://orcid.org/0009-0007-3900-2344","affiliations":[{"raw_affiliation_string":"Duke University, Durham, USA","institution_ids":["https://openalex.org/I170897317"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087182068","display_name":"Debmalya Panigrahi","orcid":"https://orcid.org/0000-0003-1799-6660"},"institutions":[{"id":"https://openalex.org/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Debmalya Panigrahi","raw_affiliation_strings":["Duke University, Durham, USA"],"raw_orcid":"https://orcid.org/0000-0003-1799-6660","affiliations":[{"raw_affiliation_string":"Duke University, Durham, USA","institution_ids":["https://openalex.org/I170897317"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"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.02876786,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"910","last_page":"921"},"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.6222000122070312,"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.6222000122070312,"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.15330000221729279,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.10429999977350235,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6990000009536743},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.6686999797821045},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.6086000204086304},{"id":"https://openalex.org/keywords/element","display_name":"Element (criminal law)","score":0.5960000157356262},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.486299991607666},{"id":"https://openalex.org/keywords/dynamic-problem","display_name":"Dynamic problem","score":0.4406999945640564},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.3905999958515167},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.3578000068664551}],"concepts":[{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6990000009536743},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.6686999797821045},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.6086000204086304},{"id":"https://openalex.org/C200288055","wikidata":"https://www.wikidata.org/wiki/Q2621792","display_name":"Element (criminal law)","level":2,"score":0.5960000157356262},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5706999897956848},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.503000020980835},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.486299991607666},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4528999924659729},{"id":"https://openalex.org/C99580578","wikidata":"https://www.wikidata.org/wiki/Q5319002","display_name":"Dynamic problem","level":2,"score":0.4406999945640564},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3905999958515167},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3781000077724457},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3578000068664551},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.31709998846054077},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.3127000033855438},{"id":"https://openalex.org/C142417499","wikidata":"https://www.wikidata.org/wiki/Q331716","display_name":"Amortized analysis","level":3,"score":0.30970001220703125},{"id":"https://openalex.org/C15312841","wikidata":"https://www.wikidata.org/wiki/Q1657198","display_name":"Set function","level":3,"score":0.2924000024795532},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.27869999408721924},{"id":"https://openalex.org/C2777168461","wikidata":"https://www.wikidata.org/wiki/Q42196253","display_name":"Set operations","level":3,"score":0.27090001106262207},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.26440000534057617},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.2517000138759613}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3798129.3800805","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800805","pdf_url":null,"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 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2511.08485","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2511.08485","pdf_url":"https://arxiv.org/pdf/2511.08485","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2511.08485","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2511.08485","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.1145/3798129.3800805","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800805","pdf_url":null,"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 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2670268800","display_name":null,"funder_award_id":"CCF-2329230","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2963856546","display_name":null,"funder_award_id":"CCF-1955703","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3356995759","display_name":null,"funder_award_id":"101170133","funder_id":"https://openalex.org/F4320321688","funder_display_name":"Erciyes \u00dcniversitesi"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320321688","display_name":"Erciyes \u00dcniversitesi","ror":"https://ror.org/047g8vk19"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0],"give":[1],"the":[2,31,67,71,83],"first":[3],"algorithms":[4],"for":[5,14,33,47,52],"fully":[6],"dynamic":[7],"set":[8],"cover":[9],"with":[10],"non-trivial":[11],"worst-case":[12,68,75],"guarantees":[13],"both":[15,34],"recourse":[16,24,56],"and":[17,25,38,57,91],"update":[18,28,58,64],"time.":[19],"Specifically,":[20],"we":[21],"achieve":[22],"O(logn)":[23,37],"f\u00b7":[26,62],"log(n)":[27,63],"time":[29,65],"in":[30,66],"worst-case,":[32],"approximation":[35],"regimes:":[36],"O(f)":[39],"approximation.":[40],"Prior":[41],"to":[42],"our":[43],"work,":[44],"all":[45],"results":[46],"this":[48],"problem":[49],"either":[50],"settled":[51],"amortized":[53],"bounds":[54],"on":[55],"time,":[59],"or":[60],"obtained":[61],"but":[69],"at":[70],"cost":[72],"of":[73,85,89],"\u03a9(m)":[74],"recourse.":[76],"(Here,":[77],"m,":[78],"n,":[79],"f":[80],"respectively":[81],"denote":[82],"number":[84,88],"sets,":[86],"maximum":[87,92],"elements,":[90],"frequency.)":[93]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-11-13T00:00:00"}