{"id":"https://openalex.org/W2074121653","doi":"https://doi.org/10.1137/060661946","title":"The Online Set Cover Problem","display_name":"The Online Set Cover Problem","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W2074121653","doi":"https://doi.org/10.1137/060661946","mag":"2074121653"},"language":"en","primary_location":{"id":"doi:10.1137/060661946","is_oa":false,"landing_page_url":"https://doi.org/10.1137/060661946","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/A5083469386","display_name":"Noga Alon","orcid":"https://orcid.org/0000-0003-1332-4883"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Noga Alon","raw_affiliation_strings":["nogaa@post.tau.ac.il#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"nogaa@post.tau.ac.il#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110260801","display_name":"Baruch Awerbuch","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Baruch Awerbuch","raw_affiliation_strings":["baruch@blaze.cs.jhu.edu#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"baruch@blaze.cs.jhu.edu#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082061504","display_name":"Yossi Azar","orcid":"https://orcid.org/0000-0002-5097-8993"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yossi Azar","raw_affiliation_strings":["azar@post.tau.ac.il#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"azar@post.tau.ac.il#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5002590915","display_name":"Niv Buchbinder","orcid":"https://orcid.org/0000-0002-7014-8954"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Niv Buchbinder","raw_affiliation_strings":["nivb@cs.technion.ac.il and naor@ cs.technion.ac.il#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"nivb@cs.technion.ac.il and naor@ cs.technion.ac.il#TAB#","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025400832","display_name":"Joseph Naor","orcid":null},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Joseph (Seffi) Naor","raw_affiliation_strings":["TECHNION-Israel Institute of Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TECHNION-Israel Institute of Technology","institution_ids":["https://openalex.org/I174306211"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":6.4121,"has_fulltext":false,"cited_by_count":123,"citation_normalized_percentile":{"value":0.96754177,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":"39","issue":"2","first_page":"361","last_page":"370"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9997000098228455,"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":0.9997000098228455,"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.9991999864578247,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7141454815864563},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.7012869119644165},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.6699278950691223},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.6665302515029907},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6333293914794922},{"id":"https://openalex.org/keywords/family-of-sets","display_name":"Family of sets","score":0.5291737914085388},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.48539483547210693},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4851997196674347},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.48428457975387573},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4813588261604309},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.47283869981765747},{"id":"https://openalex.org/keywords/element","display_name":"Element (criminal law)","score":0.4456928074359894},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.44544780254364014},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4187431037425995},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40559956431388855},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.22149717807769775},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.18984445929527283},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.0679093599319458}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7141454815864563},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.7012869119644165},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.6699278950691223},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.6665302515029907},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6333293914794922},{"id":"https://openalex.org/C150591576","wikidata":"https://www.wikidata.org/wiki/Q739925","display_name":"Family of sets","level":3,"score":0.5291737914085388},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.48539483547210693},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4851997196674347},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.48428457975387573},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4813588261604309},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.47283869981765747},{"id":"https://openalex.org/C200288055","wikidata":"https://www.wikidata.org/wiki/Q2621792","display_name":"Element (criminal law)","level":2,"score":0.4456928074359894},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.44544780254364014},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4187431037425995},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40559956431388855},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.22149717807769775},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.18984445929527283},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0679093599319458},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"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/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","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":2,"locations":[{"id":"doi:10.1137/060661946","is_oa":false,"landing_page_url":"https://doi.org/10.1137/060661946","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.221.9766","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.221.9766","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.distcomp.ethz.ch/lectures/ws0304/seminar/papers/online_set_cover.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1178745701","display_name":"Fault-Tolerance and Locality in Distributed Network         Algorithms","funder_award_id":"9114440","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/F4320322596","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49"},{"id":"https://openalex.org/F4320332180","display_name":"Defense Advanced Research Projects Agency","ror":"https://ror.org/02caytj08"},{"id":"https://openalex.org/F4320332815","display_name":"Advanced Research Projects Agency","ror":"https://ror.org/02caytj08"},{"id":"https://openalex.org/F4320338281","display_name":"Army Research Office","ror":"https://ror.org/05epdh915"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1973444128","https://openalex.org/W2040924621","https://openalex.org/W2059453880","https://openalex.org/W2093825590","https://openalex.org/W2143996311","https://openalex.org/W2157054705","https://openalex.org/W2163322487"],"related_works":["https://openalex.org/W4299302777","https://openalex.org/W2777812223","https://openalex.org/W1996806106","https://openalex.org/W2058681277","https://openalex.org/W1772565852","https://openalex.org/W2922865928","https://openalex.org/W2951573806","https://openalex.org/W4383557903","https://openalex.org/W2964121702","https://openalex.org/W4241266436"],"abstract_inverted_index":{"Let":[0,148],"$X=\\{1,2,\\ldots,n\\}$":[1],"be":[2,13,127],"a":[3,14,23,44,65,128,174,232,272,277,281],"ground":[4],"set":[5,39,78,106],"of":[6,16,18,37,79,89,94,109,131,141,154,166,176,185,194,200,215,246,275],"n":[7],"elements,":[8],"and":[9,49,91,197,230,248],"let":[10],"${\\cal":[11,80,95,149,157,178,195,201],"S}$":[12,81,96,158],"family":[15,153,175],"subsets":[17],"X,":[19],"$|{\\cal":[20],"S}|=m$,":[21],"with":[22,28,271],"positive":[24],"cost":[25,140,193,199],"$c_S$":[26],"associated":[27],"each":[29],"$S\\in{\\cal":[30],"S}$.":[31],"Consider":[32],"the":[33,38,57,70,87,92,102,105,113,121,138,142,146,152,160,164,167,169,186,189,192,198,212,216,228,267],"following":[34],"online":[35,264,283],"version":[36],"cover":[40,74],"problem,":[41],"described":[42],"as":[43],"game":[45,168],"between":[46,191],"an":[47,50,220],"algorithm":[48,58,71,161,187,226],"adversary.":[51],"An":[52],"adversary":[53,114,170],"gives":[54],"elements":[55,88,110],"to":[56,73,101,120,136],"from":[59],"X":[60,90],"one":[61],"by":[62,76,112,145,255],"one.":[63],"Once":[64],"new":[66],"element":[67],"is":[68,115,135,188,211],"given,":[69],"has":[72],"it":[75],"some":[77],"containing":[82],"it.":[83],"We":[84,218],"assume":[85],"that":[86,159,180],"members":[93],"are":[97,253],"known":[98,117],"in":[99,118,156,259],"advance":[100,119],"algorithm;":[103],"however,":[104],"$X'\\subseteq":[107],"X$":[108],"given":[111],"not":[116],"algorithm.":[122,147,217,284],"(In":[123],"general,":[124],"$X'$":[125],"may":[126],"strict":[129],"subset":[130],"X.)":[132],"The":[133,183,203,250],"objective":[134],"minimize":[137],"total":[139],"sets":[143,155,177],"chosen":[144],"C}$":[150,196],"denote":[151],"chooses.":[162],"At":[163],"end":[165],"also":[171],"produces":[172],"(offline)":[173],"C}_{OPT}$":[179],"covers":[181],"$X'$.":[182],"performance":[184],"ratio":[190,214],"C}_{OPT}$.":[202],"maximum":[204],"ratio,":[205],"taken":[206],"over":[207],"all":[208,243],"input":[209],"sequences,":[210],"competitive":[213,224],"present":[219],"$O(\\log":[221],"m\\log":[222],"n)$":[223],"deterministic":[225,282],"for":[227,242,263],"problem":[229],"establish":[231],"nearly":[233],"matching":[234],"$\\Omega\\bigl(\\frac{\\log":[235],"n\\log":[236],"m}{\\log\\log":[237],"m+\\log\\log":[238],"n}\\bigr)$":[239],"lower":[240],"bound":[241],"interesting":[244],"values":[245],"m":[247],"n.":[249],"techniques":[251,257],"used":[252],"motivated":[254],"similar":[256],"developed":[258],"computational":[260],"learning":[261],"theory":[262],"prediction":[265],"(e.g.,":[266],"WINNOW":[268],"algorithm)":[269],"together":[270],"novel":[273],"way":[274],"converting":[276],"fractional":[278],"solution":[279],"into":[280]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":11},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":9},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":9},{"year":2014,"cited_by_count":15},{"year":2013,"cited_by_count":12},{"year":2012,"cited_by_count":8}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}