{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T13:04:20Z","timestamp":1751634260320,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540662792"},{"type":"electronic","value":"9783540484479"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48447-7_9","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T21:42:14Z","timestamp":1194990134000},"page":"74-79","source":"Crossref","is-referenced-by-count":4,"title":["The Accomodating Function \u2014 A Generalization of the Competitive Ratio"],"prefix":"10.1007","author":[{"given":"Joan","family":"Boyar","sequence":"first","affiliation":[]},{"given":"Kim S.","family":"Larsen","sequence":"additional","affiliation":[]},{"given":"Morten N.","family":"Nielsen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,7,18]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/BF01294264","volume":"11","author":"S. Ben-David","year":"1994","unstructured":"S. Ben-David and A. Borodin. A New Measure for the Study of On-Line Algorithms. Algorithmica, 11:73\u201391, 1994.","journal-title":"Algorithmica"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1006\/jcss.1995.1021","volume":"50","author":"A. Borodin","year":"1995","unstructured":"Allan Borodin, Sandy Irani, Prabhakar Raghavan, and Baruch Schieber. Competitive Paging with Locality of Reference. Journal of Computer and System Sciences, 50:244\u2013258, 1995.","journal-title":"Journal of Computer and System Sciences"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Joan Boyar and Kim S. Larsen. The Seat Reservation Problem. Algorithmica. To appear.","DOI":"10.1007\/PL00009286"},{"key":"9_CR4","unstructured":"Joan Boyar, Kim S. Larsen, and Morten N. Nielsen. The Accommodating Function-a generalization of the competitive ratio. Tech. report 24, Department of Mathematics and Computer Science, Odense University, 1998."},{"key":"9_CR5","unstructured":"Joan Boyar, Kim S. Larsen, and Morten N. Nielsen. Separating the Accommodating Ratio from the Competitive Ratio. Submitted., 1999."},{"key":"9_CR6","unstructured":"M. Chrobak and J. Noga. LRU Is Better than FIFO. In 9th ACM-SIAM SODA, pages 78\u201381, 1998."},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/BF00288885","volume":"9","author":"E. G. Coffman Jr.","year":"1978","unstructured":"E. G. Coffman, Jr., J. Y-T. Leung, and D. W. Ting. Bin packing: Maximizing the number of pieces packed. Acta Informat., 9:263\u2013271, 1978.","journal-title":"Acta Informat."},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1137\/0208016","volume":"8","author":"E. G. Coffman Jr.","year":"1979","unstructured":"E. G. Coffman, Jr. and Joseph Y-T. Leung. Combinatorial Analysis of an Efficient Algorithm for Processor and Storage Allocation. SIAM J. Comput., 8:202\u2013217, 1979.","journal-title":"SIAM J. Comput."},{"key":"9_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BFb0029568","volume-title":"On-Line Packing and Covering Problems","author":"J. Csirik","year":"1998","unstructured":"J\u00e1nos Csirik and Gerhard Woeginger. On-Line Packing and Covering Problems. In Gerhard J. Woeginger Amos Fiat, editor, Lecture Notes in Computer Science, Vol. 1442: Online Algorithms, chapter 7, pages 147\u2013177. Springer-Verlag, 1998."},{"key":"9_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/BFb0029578","volume-title":"Competitive Odds and Ends","author":"A. Fiat","year":"1998","unstructured":"Amos Fiat and Gerhard J. Woeginger. Competitive Odds and Ends. In Gerhard J. Woeginger Amos Fiat, editor, Lecture Notes in Computer Science, Vol. 1442: Online Algorithms, chapter 17, pages 385\u2013394. Springer-Verlag, 1998."},{"key":"9_CR11","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"R. L. Graham","year":"1966","unstructured":"R. L. Graham. Bounds for Certain Multiprocessing Anomalies. Bell Systems Technical Journal, 45:1563\u20131581, 1966.","journal-title":"Bell Systems Technical Journal"},{"key":"9_CR12","unstructured":"Sandy Irani and Anna R. Karlin. Online Computation. In Dorit S. Hochbaum, editor, Approximation Algorithms for NP-Hard Problems, chapter 13, pages 521\u2013564. PWS Publishing Company, 1997."},{"key":"9_CR13","unstructured":"Sandy Irani, Anna R. Karlin, and Steven Philips. Strongly Competitive Algorithms for Paging with Locality of Reference. In 3rd ACM-SIAM SODA, pages 228\u2013236, 1992."},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Bala Kalyanasundaram and Kirk Pruhs. Speed is as Powerful as Clairvoyance. In 36th IEEE FOCS, pages 214\u2013221, 1995.","DOI":"10.1109\/SFCS.1995.492478"},{"key":"9_CR15","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/BF01762111","volume":"3","author":"A. R. Karlin","year":"1988","unstructured":"Anna R. Karlin, Mark S. Manasse, Larry Rudolph, and Daniel D. Sleator. Competitive Snoopy Caching. Algorithmica, 3:79\u2013119, 1988.","journal-title":"Algorithmica"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Elias Koutsoupias and Christos H. Papadimitriou. Beyond Competitive Analysis. In 35th IEEE FOCS, pages 394\u2013400, 1994.","DOI":"10.1109\/SFCS.1994.365677"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Stefano Leonardi and Danny Raz. Approximating Total Flow Time on Parallel Machinces. In 29th ACM STOC, pages 110\u2013119, 1997.","DOI":"10.1145\/258533.258562"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Cynthia A. Philips, Cliff Stein, Eric Torng, and Joel Wein. Optimal Time-Critical Scheduling via Resource Augmentation. In 29th ACM STOC, pages 140\u2013149, 1997.","DOI":"10.1145\/258533.258570"},{"issue":"2","key":"9_CR19","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D. D. Sleator","year":"1985","unstructured":"Daniel D. Sleator and Robert E. Tarjan. Amortized E.ciency of List Update and Paging Rules. Comm. of the ACM, 28(2):202\u2013208, 1985.","journal-title":"Comm. of the ACM"},{"key":"9_CR20","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/PL00009192","volume":"20","author":"E. Torng","year":"1998","unstructured":"E. Torng. A Unified Analysis of Paging and Caching. Algorithmica, 20:175\u2013200, 1998.","journal-title":"Algorithmica"},{"key":"9_CR21","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/BF01189992","volume":"11","author":"N. Young","year":"1994","unstructured":"N. Young. The k-Server Dual and Loose Competitiveness for Paging. Algorithmica, 11:525\u2013541, 1994.","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48447-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T08:29:37Z","timestamp":1737534577000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48447-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540662792","9783540484479"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-48447-7_9","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}