{"id":"https://openalex.org/W2905904719","doi":"https://doi.org/10.1137/090779000","title":"Randomized Competitive Algorithms for Generalized Caching","display_name":"Randomized Competitive Algorithms for Generalized Caching","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W2905904719","doi":"https://doi.org/10.1137/090779000","mag":"2905904719"},"language":"en","primary_location":{"id":"doi:10.1137/090779000","is_oa":false,"landing_page_url":"https://doi.org/10.1137/090779000","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":true,"oa_status":"green","oa_url":"https://research.tue.nl/en/publications/a8df0355-2a4b-42e4-9232-931cbb6bc4c9","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5008689083","display_name":"Nikhil Bansal","orcid":"https://orcid.org/0000-0002-6290-0894"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nikhil Bansal","raw_affiliation_strings":["n.bansal@tue.nl#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"n.bansal@tue.nl#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":[],"countries":[],"is_corresponding":false,"raw_author_name":"Niv Buchbinder","raw_affiliation_strings":["niv.buchbinder@gmail.com#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"niv.buchbinder@gmail.com#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025400832","display_name":"Joseph Naor","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Joseph (Seffi) Naor","raw_affiliation_strings":["naor@cs.technion.ac.il#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"naor@cs.technion.ac.il#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.9945,"has_fulltext":true,"cited_by_count":32,"citation_normalized_percentile":{"value":0.93982137,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"41","issue":"2","first_page":"391","last_page":"414"},"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/T11182","display_name":"Auction Theory and Applications","score":0.9804999828338623,"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"}},{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.9674000144004822,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.8337640166282654},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.7548576593399048},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6740337014198303},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.6701219081878662},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6168327927589417},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.5565434098243713},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.5542994141578674},{"id":"https://openalex.org/keywords/randomized-rounding","display_name":"Randomized rounding","score":0.44427844882011414},{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.43876054883003235},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.43673136830329895},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.37855085730552673},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32649749517440796},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.16723209619522095},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.11153236031532288}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.8337640166282654},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.7548576593399048},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6740337014198303},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.6701219081878662},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6168327927589417},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.5565434098243713},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.5542994141578674},{"id":"https://openalex.org/C32029473","wikidata":"https://www.wikidata.org/wiki/Q7292010","display_name":"Randomized rounding","level":3,"score":0.44427844882011414},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.43876054883003235},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.43673136830329895},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.37855085730552673},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32649749517440796},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.16723209619522095},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.11153236031532288},{"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/090779000","is_oa":false,"landing_page_url":"https://doi.org/10.1137/090779000","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:pure.tue.nl:openaire/a8df0355-2a4b-42e4-9232-931cbb6bc4c9","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/a8df0355-2a4b-42e4-9232-931cbb6bc4c9","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bansal, N, Buchbinder, N & Naor, J 2012, 'Randomized competitive algorithms for generalized caching', SIAM Journal on Computing, vol. 41, no. 2, pp. 391-414. https://doi.org/10.1137/090779000","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:tue:oai:pure.tue.nl:publications/a8df0355-2a4b-42e4-9232-931cbb6bc4c9","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/a8df0355-2a4b-42e4-9232-931cbb6bc4c9","pdf_url":"https://research.tue.nl/nl/publications/a8df0355-2a4b-42e4-9232-931cbb6bc4c9","source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Computing, 41(2), 391 - 414. Society for Industrial and Applied Mathematics (SIAM)","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:pure.tue.nl:openaire/a8df0355-2a4b-42e4-9232-931cbb6bc4c9","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/a8df0355-2a4b-42e4-9232-931cbb6bc4c9","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bansal, N, Buchbinder, N & Naor, J 2012, 'Randomized competitive algorithms for generalized caching', SIAM Journal on Computing, vol. 41, no. 2, pp. 391-414. https://doi.org/10.1137/090779000","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1552828154","https://openalex.org/W1860570137","https://openalex.org/W1918432491","https://openalex.org/W1984628625","https://openalex.org/W1998843748","https://openalex.org/W2003902046","https://openalex.org/W2025180076","https://openalex.org/W2041645394","https://openalex.org/W2042789015","https://openalex.org/W2043344147","https://openalex.org/W2044156187","https://openalex.org/W2051233655","https://openalex.org/W2052476895","https://openalex.org/W2054033098","https://openalex.org/W2081534862","https://openalex.org/W2083392624","https://openalex.org/W2089998595","https://openalex.org/W2106410102","https://openalex.org/W2122886291","https://openalex.org/W3023912806","https://openalex.org/W3125910951","https://openalex.org/W3138855735"],"related_works":["https://openalex.org/W2058681277","https://openalex.org/W1996806106","https://openalex.org/W2951573806","https://openalex.org/W2090027528","https://openalex.org/W4241266436","https://openalex.org/W2208110155","https://openalex.org/W96431103","https://openalex.org/W2047204419","https://openalex.org/W2073006754","https://openalex.org/W2070734629"],"abstract_inverted_index":{"We":[0,68],"consider":[1],"online":[2,52,118,148,164,170],"algorithms":[3,74,110,185],"for":[4,65,75,183],"the":[5,32,37,42,45,60,66,76,80,88,97,117],"generalized":[6],"caching":[7,184],"problem.":[8,67],"Here":[9],"we":[10,138,160],"are":[11,111,187],"given":[12],"a":[13,27,162,174,180],"cache":[14],"of":[15,30,40,79,96,104,116],"size":[16],"k":[17],"and":[18,23,83,124,133,186],"pages":[19,43],"with":[20,54,153],"arbitrary":[21],"sizes":[22],"fetching":[24,41],"costs.":[25],"Given":[26],"request":[28],"sequence":[29],"pages,":[31],"goal":[33],"is":[34,50],"to":[35,93,167],"minimize":[36],"total":[38],"cost":[39],"into":[44,173],"cache.":[46],"Our":[47,109,177],"main":[48],"result":[49],"an":[51,114,140,149],"algorithm":[53,64,144,172],"competitive":[55,63],"ratio":[56],"$O(\\log^2k)$,":[57],"which":[58],"gives":[59],"first":[61],"$o(k)$":[62],"also":[69],"give":[70],"improved":[71],"$O(\\log":[72,141],"k)$-competitive":[73,142],"special":[77],"cases":[78],"bit":[81],"model":[82],"fault":[84],"model,":[85],"improving":[86],"upon":[87],"previous":[89],"$O(\\log^2k)$":[90],"guarantees":[91],"due":[92],"Irani":[94],"[Proceedings":[95],"29th":[98],"Annual":[99],"ACM":[100],"Symposium":[101],"on":[102,113,146],"Theory":[103],"Computing,":[105],"1997,":[106],"pp.":[107,131],"701\u2013710].":[108],"based":[112,145],"extension":[115],"primal-dual":[119],"framework":[120,182],"introduced":[121],"by":[122],"Buchbinder":[123],"Naor":[125],"[Math.":[126],"Oper.":[127],"Res.,":[128],"34":[129],"(2009),":[130],"270\u2013286]":[132],"involve":[134],"two":[135],"steps.":[136],"First,":[137],"obtain":[139],"fractional":[143,171],"solving":[147],"LP":[150],"formulation":[151],"strengthened":[152],"exponentially":[154],"many":[155],"knapsack":[156],"cover":[157],"constraints.":[158],"Second,":[159],"design":[161],"suitable":[163],"rounding":[165],"procedure":[166],"convert":[168],"this":[169],"randomized":[175],"algorithm.":[176],"techniques":[178],"provide":[179],"unified":[181],"substantially":[188],"simpler":[189],"than":[190],"those":[191],"previously":[192],"used.":[193]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-17T09:13:05.818461","created_date":"2025-10-10T00:00:00"}