{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:22:23Z","timestamp":1725488543628},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540401766"},{"type":"electronic","value":"9783540448495"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44849-7_13","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T10:26:17Z","timestamp":1186741577000},"page":"58-69","source":"Crossref","is-referenced-by-count":13,"title":["The Relative Worst Order Ratio for On-Line Algorithms"],"prefix":"10.1007","author":[{"given":"Joan","family":"Boyar","sequence":"first","affiliation":[]},{"given":"Lene M.","family":"Favrholdt","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,5,13]]},"reference":[{"issue":"2","key":"13_CR1","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s00453-002-0965-6","volume":"34","author":"Y. Azar","year":"2002","unstructured":"Y. Azar, J. Boyar, L. Epstein, L. M. Favrholdt, K. S. Larsen, and M. N. Nielsen. Fair versus Unrestricted Bin Packing. Algorithmica, 34(2):181\u2013196, 2002.","journal-title":"Algorithmica"},{"issue":"1","key":"13_CR2","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(1):73\u201391, 1994.","journal-title":"Algorithmica"},{"key":"13_CR3","unstructured":"J. Boyar, L. M. Favrholdt, and K. S. Larsen. Work in progress."},{"issue":"1","key":"13_CR4","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1137\/S0097539799361786","volume":"31","author":"J. Boyar","year":"2001","unstructured":"J. Boyar, K. S. Larsen, and M. N. Nielsen. The Accommodating Function\u2014a Generalization of the Competitive Ratio. SIAM Journal of Computation, 31(1):233\u2013258, 2001. Also in WADS 99, pages 74\u201379.","journal-title":"SIAM Journal of Computation"},{"key":"13_CR5","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":"13_CR6","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1016\/S0022-0000(74)80026-7","volume":"8","author":"D. S. Johnson","year":"1974","unstructured":"D. S. Johnson. Fast Algorithms for Bin Packing. Journal of Computer and System Sciences, 8:272\u2013314, 1974.","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"13_CR7","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/BF01762111","volume":"3","author":"A. R. Karlin","year":"1988","unstructured":"A. R. Karlin, M. S. Manasse, L. Rudolph, and D. D. Sleator. Competitive Snoopy Caching. Algorithmica, 3(1):79\u2013119, 1988.","journal-title":"Algorithmica"},{"key":"13_CR8","unstructured":"C. Kenyon. Best-Fit Bin-Packing with Random Order. In 7th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 359\u2013364, 1996."},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"E. Koutsoupias and C. H. Papadimitriou. Beyond Competitive Analysis. In 35th Annual Symposium on Foundations of Computer Science, pages 394\u2013400, 1994.","DOI":"10.1109\/SFCS.1994.365677"},{"issue":"2","key":"13_CR10","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D. D. Sleator","year":"1985","unstructured":"D. D. Sleator and R. E. 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 and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44849-7_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T09:47:22Z","timestamp":1550742442000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44849-7_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540401766","9783540448495"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-44849-7_13","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}