{"id":"https://openalex.org/W4387401430","doi":"https://doi.org/10.1137/21m1428649","title":"Deterministic Near-Optimal Approximation Algorithms for Dynamic Set Cover","display_name":"Deterministic Near-Optimal Approximation Algorithms for Dynamic Set Cover","publication_year":2023,"publication_date":"2023-10-06","ids":{"openalex":"https://openalex.org/W4387401430","doi":"https://doi.org/10.1137/21m1428649"},"language":"en","primary_location":{"id":"doi:10.1137/21m1428649","is_oa":false,"landing_page_url":"https://doi.org/10.1137/21m1428649","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-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/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":true,"raw_author_name":"Sayan Bhattacharya","raw_affiliation_strings":["University of Warwick, Coventry CV4 7AL, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Warwick, Coventry CV4 7AL, UK","institution_ids":["https://openalex.org/I39555362"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003641345","display_name":"Monika Henzinger","orcid":"https://orcid.org/0000-0002-5008-6530"},"institutions":[{"id":"https://openalex.org/I157556583","display_name":"Institute of Science and Technology Austria","ror":"https://ror.org/03gnh5541","country_code":"AT","type":"education","lineage":["https://openalex.org/I157556583"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Monika Henzinger","raw_affiliation_strings":["Institute of Science and Technology Austria (ISTA), Vienna 1090, Austria"],"raw_orcid":"https://orcid.org/0000-0002-5008-6530","affiliations":[{"raw_affiliation_string":"Institute of Science and Technology Austria (ISTA), Vienna 1090, Austria","institution_ids":["https://openalex.org/I157556583"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074369690","display_name":"Danupon Nanongkai","orcid":"https://orcid.org/0000-0003-4468-2675"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Danupon Nanongkai","raw_affiliation_strings":["Max Planck Institute for Informatics, 66123 Saarbr\u00fccken, Germany; Saarland University, 66123 Saarbr\u00fccken, Germany; and KTH, 114 28 Stockholm, Sweden"],"raw_orcid":"https://orcid.org/0000-0003-4468-2675","affiliations":[{"raw_affiliation_string":"Max Planck Institute for Informatics, 66123 Saarbr\u00fccken, Germany; Saarland University, 66123 Saarbr\u00fccken, Germany; and KTH, 114 28 Stockholm, Sweden","institution_ids":["https://openalex.org/I4210109712"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072788986","display_name":"Xiaowei Wu","orcid":"https://orcid.org/0000-0002-5766-2115"},"institutions":[{"id":"https://openalex.org/I204512498","display_name":"University of Macau","ror":"https://ror.org/01r4q9n85","country_code":"MO","type":"education","lineage":["https://openalex.org/I204512498"]}],"countries":["MO"],"is_corresponding":false,"raw_author_name":"Xiaowei Wu","raw_affiliation_strings":["University of Macau, Taipa, Macau, China"],"raw_orcid":"https://orcid.org/0000-0002-5766-2115","affiliations":[{"raw_affiliation_string":"University of Macau, Taipa, Macau, China","institution_ids":["https://openalex.org/I204512498"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5103251160"],"corresponding_institution_ids":["https://openalex.org/I39555362"],"apc_list":null,"apc_paid":null,"fwci":0.194,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.56180297,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"52","issue":"5","first_page":"1132","last_page":"1192"},"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.9958999752998352,"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/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.995199978351593,"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/amortized-analysis","display_name":"Amortized analysis","score":0.8093140721321106},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.7581284046173096},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.625895082950592},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6100869178771973},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.6098121404647827},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.5370328426361084},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5090136528015137},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49589380621910095},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.478973388671875},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.46777597069740295},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.4632801413536072},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4355594217777252},{"id":"https://openalex.org/keywords/dynamic-problem","display_name":"Dynamic problem","score":0.4331149160861969},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3699790835380554},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.35223639011383057},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.27392593026161194},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.2703557014465332},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.12650522589683533}],"concepts":[{"id":"https://openalex.org/C142417499","wikidata":"https://www.wikidata.org/wiki/Q331716","display_name":"Amortized analysis","level":3,"score":0.8093140721321106},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.7581284046173096},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.625895082950592},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6100869178771973},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.6098121404647827},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.5370328426361084},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5090136528015137},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49589380621910095},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.478973388671875},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.46777597069740295},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.4632801413536072},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4355594217777252},{"id":"https://openalex.org/C99580578","wikidata":"https://www.wikidata.org/wiki/Q5319002","display_name":"Dynamic problem","level":2,"score":0.4331149160861969},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3699790835380554},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.35223639011383057},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.27392593026161194},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.2703557014465332},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.12650522589683533},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/21m1428649","is_oa":false,"landing_page_url":"https://doi.org/10.1137/21m1428649","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2635570357","display_name":null,"funder_award_id":"ICT 15-003","funder_id":"https://openalex.org/F4320321003","funder_display_name":"Vienna Science and Technology Fund"},{"id":"https://openalex.org/G3947296455","display_name":"Theory and Applications of Dynamic Algorithms","funder_award_id":"EP/S03353X/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G4429446286","display_name":null,"funder_award_id":"0143/2020/A3","funder_id":"https://openalex.org/F4320313610","funder_display_name":"Shanghai Science and Technology Development Foundation"},{"id":"https://openalex.org/G6353528903","display_name":null,"funder_award_id":"340506","funder_id":"https://openalex.org/F4320338352","funder_display_name":"FP7 Ideas: European Research Council"},{"id":"https://openalex.org/G6439267804","display_name":null,"funder_award_id":"EP/S03353X/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G737535551","display_name":null,"funder_award_id":"2015-04659","funder_id":"https://openalex.org/F4320321033","funder_display_name":"Svenska Forskningsr\u00e5det Formas"},{"id":"https://openalex.org/G7394863432","display_name":null,"funder_award_id":"2020B1212030003","funder_id":"https://openalex.org/F4320324202","funder_display_name":"Guangdong Science and Technology Department"},{"id":"https://openalex.org/G8541939513","display_name":null,"funder_award_id":"SRG2020-00020-IOTSC","funder_id":"https://openalex.org/F4320322841","funder_display_name":"Universidade de Macau"},{"id":"https://openalex.org/G8660613920","display_name":null,"funder_award_id":"SKL-IOTSC-2021-2023","funder_id":"https://openalex.org/F4320313610","funder_display_name":"Shanghai Science and Technology Development Foundation"},{"id":"https://openalex.org/G895032013","display_name":null,"funder_award_id":"715672","funder_id":"https://openalex.org/F4320338335","funder_display_name":"H2020 European Research Council"}],"funders":[{"id":"https://openalex.org/F4320313610","display_name":"Shanghai Science and Technology Development Foundation","ror":null},{"id":"https://openalex.org/F4320321003","display_name":"Vienna Science and Technology Fund","ror":"https://ror.org/01f9mc681"},{"id":"https://openalex.org/F4320321033","display_name":"Svenska Forskningsr\u00e5det Formas","ror":"https://ror.org/03pjs1y45"},{"id":"https://openalex.org/F4320322841","display_name":"Universidade de Macau","ror":"https://ror.org/01r4q9n85"},{"id":"https://openalex.org/F4320324202","display_name":"Guangdong Science and Technology Department","ror":"https://ror.org/00tjzgn92"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"},{"id":"https://openalex.org/F4320338335","display_name":"H2020 European Research Council","ror":"https://ror.org/0472cxd90"},{"id":"https://openalex.org/F4320338352","display_name":"FP7 Ideas: European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1963524245","https://openalex.org/W2013652529","https://openalex.org/W2115404728","https://openalex.org/W2137118456","https://openalex.org/W2157054705","https://openalex.org/W2792298309","https://openalex.org/W2900627138","https://openalex.org/W2952708184","https://openalex.org/W3125058277"],"related_works":["https://openalex.org/W2112112676","https://openalex.org/W2108073487","https://openalex.org/W4247100793","https://openalex.org/W1966805076","https://openalex.org/W2044818254","https://openalex.org/W2326642484","https://openalex.org/W2797010454","https://openalex.org/W4387401430","https://openalex.org/W4299731236","https://openalex.org/W2952391767"],"abstract_inverted_index":{"In":[0,44,80,142],"the":[1,7,12,29,34,38,41,45,85,99,103,114,144,187,197,205,216,265,279,284,325,345,387,390],"dynamic":[2,68,130,245,266,286,300,341],"minimum":[3,229,305],"set":[4,71,156,267],"cover":[5,231,247,268,288,307],"problem,":[6],"challenge":[8],"is":[9,203,209,407],"to":[10,111,421],"minimize":[11],"update":[13,60,104,108,178,182,189,219,234,254,259,281,311,351,371,392],"time":[14,61,190,220,260,282,427,434],"while":[15],"guaranteeing":[16],"a":[17,54,95,172,227,276,330,335,349,369,401],"close-to-optimal":[18],"approximation":[19,116],"factor.":[20],"(Throughout,":[21],",":[22,23,24,49,89],"and":[25,40,67,90,98,126,160,212,223,250,273,292,297,304,389],"are":[26],"parameters":[27],"denoting":[28],"maximum":[30,302],"number":[31,35],"of":[32,36,123,129,151,195,211,221,294,403],"elements,":[33],"sets,":[37],"frequency,":[39],"cost":[42],"range.)":[43],"high-frequency":[46],"range,":[47,87,199],"when":[48,88,249,291],"this":[50,81,413],"was":[51,122,149,261],"achieved":[52],"by":[53,62,119,275,328],"deterministic":[55,92,120],"-approximation":[56,96,148,174],"algorithm":[57,175],"with":[58,94,147,176,424,431],"amortized":[59,107,177,181,218,233,425],"Gupta":[63],"et":[64,153],"al.":[65,154],"[Online":[66],"algorithms":[69,93,121,131,159,342,423,430],"for":[70,192,243,264,283,359],"cover,":[72],"in":[73,135,163,196,232,236,308,313,340],"Proceedings":[74,136,164,237,314],"STOC":[75,165],"2017,":[76,316],"ACM,":[77,167],"pp.":[78,140,168,241,318],"537\u2013550].":[79],"paper":[82],"we":[83,366,385,399],"consider":[84],"low-frequency":[86,198],"obtain":[91],"ratio":[97,117],"following":[100],"guarantees":[101],"on":[102],"time.":[105,179],"(1)":[106],"time:":[109,183,255],"Prior":[110,338],"our":[112,322,363,382,396],"work,":[113],"best":[115],"guaranteed":[118],"Bhattacharya,":[124,295],"Henzinger,":[125,296],"Italiano":[127],"[Design":[128],"via":[132,324],"primal-dual":[133,326,346],"method,":[134],"ICALP":[137],"2015,":[138],"Springer,":[139],"206\u2013218].":[141],"contrast,":[143],"only":[145],"result":[146,185,207,365,384,398],"that":[150,208,343,353,373],"Abboud":[152],"[Dynamic":[155],"cover:":[157],"Improved":[158],"lower":[161],"bounds,":[162],"2019,":[166,239],"114\u2013125],":[169],"who":[170],"designed":[171],"randomized":[173],"(2)":[180],"This":[184],"improves":[186,274],"above":[188],"bound":[191,271],"most":[193],"values":[194],"i.e.,":[200],".":[201,213],"It":[202,214,406],"also":[204,418],"first":[206,364],"independent":[210],"subsumes":[215,272],"constant":[217],"Bhattacharya":[222],"Kulkarni":[224],"[Deterministically":[225],"maintaining":[226,329],"-approximate":[228],"vertex":[230,246,287,306],"time,":[235,312],"SODA":[238,315],"SIAM,":[240,317],"1872\u20131885]":[242],"unweighted":[244,285],"(i.e.,":[248,290],").":[251],"(3)":[252],"worst-case":[253,258,280,432],"No":[256],"nontrivial":[257],"previously":[262],"known":[263],"problem.":[269],"Our":[270],"logarithmic":[277],"factor":[278],"problem":[289],")":[293],"Nanongkai":[298],"[Fully":[299],"approximate":[301],"matching":[303],"worst":[309],"case":[310],"470\u2013489].":[319],"We":[320],"achieve":[321,395],"results":[323],"approach,":[327],"fractional":[331],"packing":[332],"solution":[333],"as":[334],"dual":[336],"certificate.":[337],"work":[339],"employs":[344],"approach":[347],"uses":[348],"local":[350,391],"scheme":[352,372],"maintains":[354],"relaxed":[355],"complementary":[356,378],"slackness":[357,379],"conditions":[358],"every":[360],"set.":[361],"For":[362,381],"use":[367,400],"instead":[368],"global":[370,388],"does":[374],"not":[375],"always":[376],"maintain":[377],"conditions.":[380],"second":[383],"combine":[386],"schema.":[393],"To":[394],"third":[397],"hierarchy":[402],"background":[404,414],"schedulers.":[405],"an":[408],"interesting":[409],"open":[410],"question":[411],"whether":[412],"scheduler":[415],"technique":[416],"can":[417],"be":[419],"used":[420],"transform":[422],"running":[426,433],"bounds":[428],"into":[429],"bounds.":[435]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}