{"id":"https://openalex.org/W3036340251","doi":"https://doi.org/10.1137/20m1346286","title":"Caching with Time Windows and Delays","display_name":"Caching with Time Windows and Delays","publication_year":2022,"publication_date":"2022-07-07","ids":{"openalex":"https://openalex.org/W3036340251","doi":"https://doi.org/10.1137/20m1346286","mag":"3036340251"},"language":"en","primary_location":{"id":"doi:10.1137/20m1346286","is_oa":false,"landing_page_url":"https://doi.org/10.1137/20m1346286","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/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":false,"raw_author_name":"Anupam Gupta","raw_affiliation_strings":["Computer Science Department, Carnegie Mellon University, Pittsburgh, PA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, Carnegie Mellon University, Pittsburgh, PA","institution_ids":["https://openalex.org/I74973139"]}]},{"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":["Department of Computer Science and Engineering, IIT Delhi, New Delhi, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, IIT Delhi, New 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":["Department of Computer Science, Duke University, Durham, NC"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Duke University, Durham, NC","institution_ids":["https://openalex.org/I170897317"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3499,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.56715775,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"51","issue":"4","first_page":"975","last_page":"1017"},"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/T11478","display_name":"Caching and Content Delivery","score":0.9944999814033508,"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/T13553","display_name":"Age of Information Optimization","score":0.9645000100135803,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/paging","display_name":"Paging","score":0.9431865811347961},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7129524946212769},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.5586341023445129},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.5136496424674988},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5136281847953796},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.4635894000530243},{"id":"https://openalex.org/keywords/demand-paging","display_name":"Demand paging","score":0.46149691939353943},{"id":"https://openalex.org/keywords/virtual-memory","display_name":"Virtual memory","score":0.39582207798957825},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2918652892112732},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.28638535737991333},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.2835395336151123},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2815878987312317},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.279610812664032},{"id":"https://openalex.org/keywords/memory-management","display_name":"Memory management","score":0.13645097613334656}],"concepts":[{"id":"https://openalex.org/C50954386","wikidata":"https://www.wikidata.org/wiki/Q656083","display_name":"Paging","level":2,"score":0.9431865811347961},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7129524946212769},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.5586341023445129},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.5136496424674988},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5136281847953796},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.4635894000530243},{"id":"https://openalex.org/C188873839","wikidata":"https://www.wikidata.org/wiki/Q5255045","display_name":"Demand paging","level":5,"score":0.46149691939353943},{"id":"https://openalex.org/C76399640","wikidata":"https://www.wikidata.org/wiki/Q189401","display_name":"Virtual memory","level":4,"score":0.39582207798957825},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2918652892112732},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.28638535737991333},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.2835395336151123},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2815878987312317},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.279610812664032},{"id":"https://openalex.org/C176649486","wikidata":"https://www.wikidata.org/wiki/Q2308807","display_name":"Memory management","level":3,"score":0.13645097613334656},{"id":"https://openalex.org/C136085584","wikidata":"https://www.wikidata.org/wiki/Q910289","display_name":"Overlay","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/20m1346286","is_oa":false,"landing_page_url":"https://doi.org/10.1137/20m1346286","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/G4606594371","display_name":"AF: Small: New Approaches for Approximation and Online Algorithms","funder_award_id":"1907820","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5226018963","display_name":"CAREER: New Directions in Graph Algorithms","funder_award_id":"1750140","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/G6671297155","display_name":null,"funder_award_id":"CAREER","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G960684400","display_name":null,"funder_award_id":"IUSSTF/JC-017/2017","funder_id":"https://openalex.org/F4320320738","funder_display_name":"Indo-US Science and Technology Forum"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320320738","display_name":"Indo-US Science and Technology Forum","ror":"https://ror.org/03sw64e71"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W1980842804","https://openalex.org/W1987225815","https://openalex.org/W2003902046","https://openalex.org/W2025180076","https://openalex.org/W2031816824","https://openalex.org/W2033156334","https://openalex.org/W2041645394","https://openalex.org/W2044156187","https://openalex.org/W2054033098","https://openalex.org/W2059474057","https://openalex.org/W2089998595","https://openalex.org/W2107417081","https://openalex.org/W2136115647","https://openalex.org/W2189860656","https://openalex.org/W2217086073","https://openalex.org/W2295274877","https://openalex.org/W2569244175","https://openalex.org/W2569356155","https://openalex.org/W2750046462","https://openalex.org/W2807287186","https://openalex.org/W2898704135","https://openalex.org/W2911502905","https://openalex.org/W2939692444","https://openalex.org/W2962687396","https://openalex.org/W2962989976","https://openalex.org/W2972177954","https://openalex.org/W3126483964","https://openalex.org/W4237102200","https://openalex.org/W4240846525"],"related_works":["https://openalex.org/W2175633367","https://openalex.org/W1491323468","https://openalex.org/W2051902145","https://openalex.org/W1009057809","https://openalex.org/W1553390825","https://openalex.org/W1600005412","https://openalex.org/W2142949082","https://openalex.org/W1538411730","https://openalex.org/W2503458771","https://openalex.org/W23663342"],"abstract_inverted_index":{"We":[0,196,253],"consider":[1,255],"two":[2],"generalizations":[3],"of":[4,14,17,61,121,140,150,160,170,181,190,217,228,238,248,293,302,313,323,331],"the":[5,12,23,35,66,71,84,93,107,112,141,161,182,204,224,239,256,275,279,291,303,309,314,318,321,328],"classical":[6,36],"weighted":[7,37],"paging":[8,25,38,86],"problem":[9,39,55,82,110,114,306,338],"that":[10,41,123,307],"incorporate":[11],"notion":[13],"delayed":[15,117],"service":[16],"page":[18,43,98],"requests.":[19],"The":[20,77],"first":[21,276,329],"is":[22,33,83,296,327],"(weighted)":[24,85],"with":[26,87,214,339],"time":[27],"windows":[28],"(\\sf":[29,89],"PageTW)":[30],"problem,":[31,91],"which":[32,265],"like":[34],"except":[40],"each":[42],"request":[44,99],"only":[45],"needs":[46],"to":[47,106,115],"be":[48],"served":[49],"before":[50,287],"a":[51,97,102,119,215,297],"given":[52],"deadline.":[53],"This":[54,109,220],"arises":[56],"in":[57,70,95,101,128],"many":[58],"practical":[59],"applications":[60],"online":[62,129,337],"caching,":[63],"such":[64],"as":[65],"\u201cdeadline\u201d":[67],"I/O":[68],"scheduler":[69],"Linux":[72],"kernel":[73],"and":[74,79,136,177,207,260,270],"video-on-demand":[75],"streaming.":[76],"second,":[78],"more":[80],"general,":[81],"delay":[88,94],"PageD)":[90],"where":[92],"serving":[96],"results":[100,277],"penalty":[103],"being":[104],"added":[105],"objective.":[108],"generalizes":[111],"caching":[113],"allow":[116],"service,":[118],"line":[120],"work":[122],"has":[124],"recently":[125],"gained":[126],"traction":[127],"algorithms":[130,201,269,295],"(e.g.,":[131],"[Y.":[132,233],"Emek,":[133],"S.":[134],"Kutten,":[135],"R.":[137],"Wattenhofer,":[138],"Proceedings":[139,159,180,237],"48":[142],"th":[143,163,184,241],"Annual":[144,164,186,242],"ACM":[145,165,243],"SIGACT":[146,166,244],"Symposium":[147,167,187,245],"on":[148,168,188,211,223,246],"Theory":[149,169,247],"Computing,":[151,171,249],"2016,":[152],"pp.":[153,173,194,251],"333--344;":[154],"Y.":[155,175],"Azar":[156,176,234],"et":[157,235],"al.,":[158,236],"49":[162,240],"2017,":[172,250],"551--563;":[174],"N.":[178],"Touitou,":[179],"60":[183],"IEEE":[185],"Foundations":[189],"Computer":[191],"Science,":[192],"2019,":[193],"60--71]).":[195],"give":[197,267],"$O(\\log":[198],"k\\log":[199],"n)$-competitive":[200],"for":[202,230,264,278,317,335],"both":[203,231],"\\sf":[205,208,258,261,304],"PageTW":[206,259,305],"PageD":[209,262],"problems":[210,232],"$n$":[212],"pages":[213],"cache":[216],"size":[218],"$k$.":[219],"significantly":[221],"improves":[222],"previous":[225],"best":[226,322],"bounds":[227],"$O(k)$":[229],"551--563].":[252],"also":[254],"offline":[257,280],"problems,":[263],"we":[266],"$O(1)$-approximation":[268],"prove":[271],"APX-hardness.":[272],"These":[273],"are":[274],"problems;":[281],"even":[282],"NP-hardness":[283],"was":[284],"not":[285],"known":[286],"our":[288,294,324],"work.":[289],"At":[290],"heart":[292],"novel":[298],"\u201chitting-set\u201d":[299],"LP":[300,316],"relaxation":[301],"overcomes":[308],"$\\Omega(k)$":[310],"integrality":[311],"gap":[312],"natural":[315],"problem.":[319],"To":[320],"knowledge,":[325],"this":[326],"example":[330],"an":[332,336],"LP-based":[333],"algorithm":[334],"delays/deadlines.":[340]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2026-08-22T07:34:49.880490","created_date":"2025-10-10T00:00:00"}