{"id":"https://openalex.org/W2951922466","doi":"https://doi.org/10.1145/3313276.3316376","title":"Dynamic set cover: improved algorithms and lower bounds","display_name":"Dynamic set cover: improved algorithms and lower bounds","publication_year":2019,"publication_date":"2019-06-20","ids":{"openalex":"https://openalex.org/W2951922466","doi":"https://doi.org/10.1145/3313276.3316376","mag":"2951922466"},"language":"en","primary_location":{"id":"doi:10.1145/3313276.3316376","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3313276.3316376","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of 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/A5051832024","display_name":"Amir Abboud","orcid":"https://orcid.org/0000-0002-0502-4517"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Amir Abboud","raw_affiliation_strings":["IBM Research, USA"],"affiliations":[{"raw_affiliation_string":"IBM Research, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025800378","display_name":"Raghavendra Addanki","orcid":"https://orcid.org/0000-0003-1478-083X"},"institutions":[{"id":"https://openalex.org/I24603500","display_name":"University of Massachusetts Amherst","ror":"https://ror.org/0072zz521","country_code":"US","type":"education","lineage":["https://openalex.org/I24603500"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Raghavendra Addanki","raw_affiliation_strings":["University of Massachusetts at Amherst, USA"],"affiliations":[{"raw_affiliation_string":"University of Massachusetts at Amherst, USA","institution_ids":["https://openalex.org/I24603500"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034276567","display_name":"Fabrizio Grandoni","orcid":"https://orcid.org/0000-0002-9676-4931"},"institutions":[{"id":"https://openalex.org/I2614128279","display_name":"Dalle Molle Institute for Artificial Intelligence Research","ror":"https://ror.org/013355g38","country_code":"CH","type":"facility","lineage":["https://openalex.org/I15196421","https://openalex.org/I2614128279","https://openalex.org/I57201433"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Fabrizio Grandoni","raw_affiliation_strings":["IDSIA, Switzerland"],"affiliations":[{"raw_affiliation_string":"IDSIA, Switzerland","institution_ids":["https://openalex.org/I2614128279"]}]},{"author_position":"middle","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, USA"],"affiliations":[{"raw_affiliation_string":"Duke University, USA","institution_ids":["https://openalex.org/I170897317"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110611660","display_name":"Barna Saha","orcid":null},"institutions":[{"id":"https://openalex.org/I24603500","display_name":"University of Massachusetts Amherst","ror":"https://ror.org/0072zz521","country_code":"US","type":"education","lineage":["https://openalex.org/I24603500"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Barna Saha","raw_affiliation_strings":["University of Massachusetts at Amherst, USA"],"affiliations":[{"raw_affiliation_string":"University of Massachusetts at Amherst, USA","institution_ids":["https://openalex.org/I24603500"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5051832024"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.996,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.95687013,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"114","last_page":"125"},"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.9998000264167786,"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.9998000264167786,"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.9994000196456909,"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/T12404","display_name":"Mathematical Approximation and Integration","score":0.9944999814033508,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"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/cover","display_name":"Cover (algebra)","score":0.7786706686019897},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.7502934336662292},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6561911106109619},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6416846513748169},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.59140545129776},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5321955680847168},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5170950889587402},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4762435257434845},{"id":"https://openalex.org/keywords/dynamic-problem","display_name":"Dynamic problem","score":0.4548320472240448},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.44196653366088867},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.42314282059669495},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.37470245361328125},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3682304322719574},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.34212666749954224},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.06061834096908569}],"concepts":[{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.7786706686019897},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.7502934336662292},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6561911106109619},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6416846513748169},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.59140545129776},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5321955680847168},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5170950889587402},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4762435257434845},{"id":"https://openalex.org/C99580578","wikidata":"https://www.wikidata.org/wiki/Q5319002","display_name":"Dynamic problem","level":2,"score":0.4548320472240448},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.44196653366088867},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.42314282059669495},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.37470245361328125},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3682304322719574},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.34212666749954224},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.06061834096908569},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3313276.3316376","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3313276.3316376","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320924","display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung","ror":"https://ror.org/00yjd3n13"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W1017666284","https://openalex.org/W1934874173","https://openalex.org/W1982440947","https://openalex.org/W1983248819","https://openalex.org/W1992869351","https://openalex.org/W2044471216","https://openalex.org/W2045430818","https://openalex.org/W2096413587","https://openalex.org/W2121473031","https://openalex.org/W2137118456","https://openalex.org/W2146507303","https://openalex.org/W2153715991","https://openalex.org/W2165621523","https://openalex.org/W2178621981","https://openalex.org/W2226187912","https://openalex.org/W2244920958","https://openalex.org/W2261727491","https://openalex.org/W2341465683","https://openalex.org/W2546514055","https://openalex.org/W2550458906","https://openalex.org/W2562376154","https://openalex.org/W2565540516","https://openalex.org/W2618849866","https://openalex.org/W2646549016","https://openalex.org/W2748190518","https://openalex.org/W2780348996","https://openalex.org/W2809864751","https://openalex.org/W2949477394","https://openalex.org/W2950893338","https://openalex.org/W2962761621","https://openalex.org/W2963645943","https://openalex.org/W2963924972","https://openalex.org/W2963964051","https://openalex.org/W2964007887","https://openalex.org/W3125524485","https://openalex.org/W4210631930"],"related_works":["https://openalex.org/W2112112676","https://openalex.org/W2108073487","https://openalex.org/W4247100793","https://openalex.org/W3159572760","https://openalex.org/W2782292024","https://openalex.org/W2551034790","https://openalex.org/W1502438505","https://openalex.org/W2951888513","https://openalex.org/W4301954754","https://openalex.org/W2019875157"],"abstract_inverted_index":{"We":[0],"give":[1,15],"new":[2],"upper":[3],"and":[4,93],"lower":[5],"bounds":[6,87],"for":[7,19,29,78],"the":[8,37,48,51,67,85,90,96,103],"dynamic":[9,21,79,104],"set":[10,22,80],"cover":[11,23],"problem.":[12],"First,":[13],"we":[14],"a":[16],"(1+\u0454)":[17,63],"f-approximation":[18],"fully":[20],"in":[24,76,89,102],"O(f2logn/\u04545)":[25],"(amortized)":[26],"update":[27,52],"time,":[28],"any":[30],"\u0454":[31],">":[32],"0,":[33],"where":[34],"f":[35,77],"is":[36],"maximum":[38],"number":[39],"of":[40,100],"sets":[41],"that":[42,70],"an":[43,62,72],"element":[44],"belongs":[45],"to.":[46],"In":[47],"decremental":[49],"setting,":[50],"time":[53],"can":[54],"be":[55],"improved":[56],"to":[57],"O(f2/\u04545),":[58],"while":[59],"still":[60],"obtaining":[61],"f-approximation.":[64],"These":[65],"are":[66],"first":[68],"algorithms":[69],"obtain":[71],"approximation":[73,99],"factor":[74],"linear":[75],"cover,":[81],"thereby":[82],"almost":[83],"matching":[84],"best":[86,98],"known":[88],"offline":[91],"setting":[92],"improving":[94],"upon":[95],"previous":[97],"O(f2)":[101],"setting.":[105]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":10},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}