{"id":"https://openalex.org/W2550458906","doi":"https://doi.org/10.1145/3055399.3055493","title":"Online and dynamic algorithms for set cover","display_name":"Online and dynamic algorithms for set cover","publication_year":2017,"publication_date":"2017-06-15","ids":{"openalex":"https://openalex.org/W2550458906","doi":"https://doi.org/10.1145/3055399.3055493","mag":"2550458906"},"language":"en","primary_location":{"id":"doi:10.1145/3055399.3055493","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3055399.3055493","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=3055493&type=pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"http://dl.acm.org/ft_gateway.cfm?id=3055493&type=pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5078381067","display_name":"Anupam Gupta","orcid":"https://orcid.org/0000-0001-5579-3405"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Anupam Gupta","raw_affiliation_strings":["Carnegie Mellon University, USA"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5060555975","display_name":"Ravishankar Krishnaswamy","orcid":"https://orcid.org/0000-0002-5765-0843"},"institutions":[{"id":"https://openalex.org/I4210124949","display_name":"Microsoft Research (India)","ror":"https://ror.org/02w7f3w92","country_code":"IN","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210124949"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Ravishankar Krishnaswamy","raw_affiliation_strings":["Microsoft Research, India"],"affiliations":[{"raw_affiliation_string":"Microsoft Research, India","institution_ids":["https://openalex.org/I4210124949"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5029407896","display_name":"Amit Kumar","orcid":"https://orcid.org/0000-0002-3965-6627"},"institutions":[{"id":"https://openalex.org/I68891433","display_name":"Indian Institute of Technology Delhi","ror":"https://ror.org/049tgcd06","country_code":"IN","type":"education","lineage":["https://openalex.org/I68891433"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Amit Kumar","raw_affiliation_strings":["IIT Delhi, India"],"affiliations":[{"raw_affiliation_string":"IIT Delhi, India","institution_ids":["https://openalex.org/I68891433"]}]},{"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, USA"],"affiliations":[{"raw_affiliation_string":"Duke University, USA","institution_ids":["https://openalex.org/I170897317"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5078381067"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":7.2367,"has_fulltext":true,"cited_by_count":71,"citation_normalized_percentile":{"value":0.97338258,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"537","last_page":"550"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9984999895095825,"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.9940999746322632,"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-cover-problem","display_name":"Set cover problem","score":0.8111072778701782},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.7611725330352783},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6808415055274963},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6774446368217468},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.6569708585739136},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6073700189590454},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.5697930455207825},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.5533996820449829},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.532680094242096},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5048931241035461},{"id":"https://openalex.org/keywords/dynamic-problem","display_name":"Dynamic problem","score":0.4642978310585022},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.42765721678733826},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.2591966688632965},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24935248494148254}],"concepts":[{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.8111072778701782},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.7611725330352783},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6808415055274963},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6774446368217468},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6569708585739136},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6073700189590454},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.5697930455207825},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.5533996820449829},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.532680094242096},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5048931241035461},{"id":"https://openalex.org/C99580578","wikidata":"https://www.wikidata.org/wiki/Q5319002","display_name":"Dynamic problem","level":2,"score":0.4642978310585022},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.42765721678733826},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.2591966688632965},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24935248494148254},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3055399.3055493","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3055399.3055493","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=3055493&type=pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3055399.3055493","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3055399.3055493","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=3055493&type=pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2528371460","display_name":"AF: Small: Allocation Algorithms in Online Systems","funder_award_id":"1527084","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2564752090","display_name":"CCF-BSF: AF: Small: Metric Embeddings and Partitioning for Minor-Closed Graph Families","funder_award_id":"1617790","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3081260677","display_name":null,"funder_award_id":"CCF-1536002","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4898802086","display_name":null,"funder_award_id":"CCF-1527084","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5049668581","display_name":null,"funder_award_id":"CCF-1617790","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5552157593","display_name":"AitF: FULL: Collaborative Research:  Practical Foundations for Software-Defined Network Optimization","funder_award_id":"1536002","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5857933033","display_name":"AitF: FULL: Collaborative Research: Optimizing Networked Systems with Limited Information","funder_award_id":"1535972","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7291707221","display_name":null,"funder_award_id":"CCF-1535972","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7334382270","display_name":"BSF: 2014414: New Challenges and Perspectives in Online Algorithms","funder_award_id":"1540541","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8055637304","display_name":null,"funder_award_id":"1536002, 1540541, 1617790, 1527084, 1535972","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"},{"id":"https://openalex.org/F4320334164","display_name":"Simons Institute for the Theory of Computing, University of California Berkeley","ror":null}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2550458906.pdf","grobid_xml":"https://content.openalex.org/works/W2550458906.grobid-xml"},"referenced_works_count":40,"referenced_works":["https://openalex.org/W1017666284","https://openalex.org/W1495408248","https://openalex.org/W1501694180","https://openalex.org/W1547923038","https://openalex.org/W1590242304","https://openalex.org/W1864228528","https://openalex.org/W1899379166","https://openalex.org/W1934874173","https://openalex.org/W1983248819","https://openalex.org/W1993260581","https://openalex.org/W2016757663","https://openalex.org/W2029437526","https://openalex.org/W2031592993","https://openalex.org/W2044471216","https://openalex.org/W2050345497","https://openalex.org/W2051294918","https://openalex.org/W2071608792","https://openalex.org/W2074121653","https://openalex.org/W2083036176","https://openalex.org/W2093101813","https://openalex.org/W2096413587","https://openalex.org/W2146507303","https://openalex.org/W2153715991","https://openalex.org/W2155096670","https://openalex.org/W2161965494","https://openalex.org/W2172490232","https://openalex.org/W2178621981","https://openalex.org/W2226187912","https://openalex.org/W2244920958","https://openalex.org/W2261727491","https://openalex.org/W2296273994","https://openalex.org/W2341465683","https://openalex.org/W2344590581","https://openalex.org/W2952391767","https://openalex.org/W2952817443","https://openalex.org/W2953046187","https://openalex.org/W6604928543","https://openalex.org/W6629590556","https://openalex.org/W6682466950","https://openalex.org/W6826464809"],"related_works":["https://openalex.org/W4213299358","https://openalex.org/W2564742953","https://openalex.org/W2793095688","https://openalex.org/W1623410360","https://openalex.org/W3115340459","https://openalex.org/W2950803469","https://openalex.org/W2084729404","https://openalex.org/W1965725119","https://openalex.org/W4299731236","https://openalex.org/W2952391767"],"abstract_inverted_index":{"In":[0,17],"this":[1,18],"paper,":[2],"we":[3],"give":[4],"new":[5],"results":[6,160],"for":[7,39,90,105,157],"the":[8,13,20,40,62,64,69,73,77,79,91,98,120,130,138],"set":[9,21,93,106],"cover":[10,94],"problem":[11,95],"in":[12,48,55,61,76,161],"fully":[14],"dynamic":[15,57,92],"model.":[16],"model,":[19],"of":[22,72,82,115,122,141,179],"\"active\"":[23],"elements":[24,125],"to":[25,34,67,111,174],"be":[26],"covered":[27],"changes":[28,47],"over":[29],"time.":[30],"The":[31,108],"goal":[32,65],"is":[33,53,66,84,119],"maintain":[35],"a":[36,112,144],"near-optimal":[37],"solution":[38],"currently":[41,123,145],"active":[42,124,146],"elements,":[43],"while":[44,75,129],"making":[45],"few":[46],"each":[49],"timestep.":[50],"This":[51],"model":[52],"popular":[54],"both":[56,162],"and":[58,101,167],"online":[59],"algorithms:":[60],"former,":[63],"minimize":[68],"update":[70,164],"time":[71,165],"solution,":[74],"latter,":[78],"recourse":[80],"(number":[81],"changes)":[83],"bounded.":[85],"We":[86,150],"present":[87],"generic":[88],"techniques":[89,154,172],"inspired":[96],"by":[97],"classic":[99],"greedy":[100],"primal-dual":[102],"offline":[103],"algorithms":[104],"cover.":[107],"former":[109],"leads":[110],"competitive":[113,133],"ratio":[114],"O(lognt),":[116],"where":[117],"nt":[118],"number":[121,140],"at":[126],"timestep":[127],"t,":[128],"latter":[131],"yields":[132],"ratios":[134],"dependent":[135],"on":[136],"ft,":[137],"maximum":[139],"sets":[142],"that":[143,152],"element":[147],"belongs":[148],"to.":[149],"demonstrate":[151],"these":[153,175],"are":[155],"useful":[156],"obtaining":[158],"tight":[159],"settings:":[163],"bounds":[166],"limited":[168],"recourse,":[169],"exhibiting":[170],"algorithmic":[171],"common":[173],"two":[176],"parallel":[177],"threads":[178],"research.":[180]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":18},{"year":2020,"cited_by_count":11},{"year":2019,"cited_by_count":13},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}