{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T15:00:48Z","timestamp":1742396448740},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540410041"},{"type":"electronic","value":"9783540452539"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-45253-2_7","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T16:06:25Z","timestamp":1194969985000},"page":"64-75","source":"Crossref","is-referenced-by-count":10,"title":["Online Algorithms for Caching Multimedia Streams"],"prefix":"10.1007","author":[{"given":"Matthew","family":"Andrews","sequence":"first","affiliation":[]},{"given":"Kamesh","family":"Munagala","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,2,11]]},"reference":[{"unstructured":"S. Albers, S. Arora and S. Khanna. Page replacement for general caching problems. Proceedings of the 10th Annual Symposium on Discrete Algorithms, 31\u201340, 1999.","key":"7_CR1"},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1147\/sj.52.0078","volume":"5","author":"L. Belady","year":"1966","unstructured":"L. Belady. A study of replacement algorithms for virtual storage computers. IBM System Journal, 5:78\u2013101, 1966.","journal-title":"IBM System Journal"},{"doi-asserted-by":"crossref","unstructured":"A. Dan and D. Sitaram. A generalized interval caching policy for mixed interactive and long video environments. Multimedia Computing and Networking, January 1996.","key":"7_CR3","DOI":"10.1117\/12.235887"},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1016\/0196-6774(91)90041-V","volume":"12","author":"A. Fiat","year":"1991","unstructured":"A. Fiat, R. Karp, M. Luby, L. McGeoch, D. Sleator and N. Young. Competitive paging algorithms. Journal of Algorithms, 12:685\u2013699, 1991.","journal-title":"Journal of Algorithms"},{"unstructured":"M. Hofmann, T.S.E. Ng, K. Guo, S. Paul and H. Zhang. Caching techniques for streaming multimedia over the internet. Bell Laboratories Technical Memorandum, May 1999.","key":"7_CR5"},{"unstructured":"D. Hochbaum. Various notions of approximations: Good, better, best, and more. In Approximation Algorithms for NP-Hard Problems, D. Hochbaum, Ed. PWS Publishing Company, 1995.","key":"7_CR6"},{"doi-asserted-by":"crossref","unstructured":"D. Karger, E. Lehman, T. Leighton, M. Levine, D. Lewin and R. Panigrahy. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web. Proceedings of the 29th Annual ACM Symposium on Theory of Computing, 654\u2013663, 1997.","key":"7_CR7","DOI":"10.1145\/258533.258660"},{"doi-asserted-by":"crossref","unstructured":"B. Li, M. Golin, G. Italiano, X. Deng and K. Sohraby. On the optimal placement of web proxies in the internet. Proceedings of INFOCOM\u2019 99, 1282\u20131290, 1999.","key":"7_CR8","DOI":"10.1109\/INFCOM.1999.752146"},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"816","DOI":"10.1007\/BF01759073","volume":"6","author":"L. McGeoch","year":"1991","unstructured":"L. McGeoch and D. Sleator. A strongly competitive randomized paging algorithm. Algorithmica, 6:816\u2013825, 1991.","journal-title":"Algorithmica"},{"doi-asserted-by":"crossref","unstructured":"G. Plaxton and R. Rajaraman. Fast fault-tolerant concurrent access to shared objects. Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 570\u2013579, 1996.","key":"7_CR10","DOI":"10.1109\/SFCS.1996.548516"},{"doi-asserted-by":"crossref","unstructured":"S. Sen, J. Rexford and D. Towsley. Proxy prefix caching for multimedia streams. Proceedings of INFOCOM\u2019 99, 1310\u20131319, 1999.","key":"7_CR11","DOI":"10.1109\/INFCOM.1999.752149"},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/BF01585178","volume":"62","author":"D. Shmoys","year":"1993","unstructured":"D. Shmoys and E. Tardos. An approximation algorithm for the generalized assignment problem. Mathematical Programming, 62:461\u2013474, 1993.","journal-title":"Mathematical Programming"},{"issue":"2","key":"7_CR13","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D. Sleator","year":"1985","unstructured":"D. Sleator and R. Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM, 28(2):202\u2013208, 1985.","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45253-2_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T06:51:17Z","timestamp":1556952677000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45253-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540410041","9783540452539"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-45253-2_7","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}