{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T14:10:05Z","timestamp":1737123005024,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540439967"},{"type":"electronic","value":"9783540456551"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45655-4_11","type":"book-chapter","created":{"date-parts":[[2007,5,21]],"date-time":"2007-05-21T11:37:01Z","timestamp":1179747421000},"page":"87-96","source":"Crossref","is-referenced-by-count":0,"title":["Extending the Accommodating Function"],"prefix":"10.1007","author":[{"given":"Joan","family":"Boyar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lene M.","family":"Favrholdt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kim S.","family":"Larsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Morten N.","family":"Nielsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,8,29]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Y. Azar, J. Boyar, L. Epstein, L. M. Favrholdt, K. S. Larsen, and M. N. Nielsen. Fair versus Unrestricted Bin Packing. Algorithmica. To appear. Preliminary version in SWAT 2000.","DOI":"10.1007\/3-540-44985-X_18"},{"key":"11_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/3-540-44985-X_17","volume-title":"SWAT 2000","author":"Y. Azar","year":"2000","unstructured":"Y. Azar, L. Epstein, and R. van Stee. Resource Augmentation in Load Balancing. In SWAT 2000, volume 1851 of LNCS, pages 189\u2013199, 2000."},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"E. Bach, J. Boyar, L. Epstein, L. M. Favrholdt, T. Jiang, K. S. Larsen, G.-H. Lin, and R. van Stee. Tight Bounds on the Competitive Ratio on Accommodating Sequences for the Seat Reservation Problem. Journal of Scheduling. To appear. Preliminary version in COCOON 2000.","DOI":"10.1007\/3-540-44968-X_22"},{"key":"11_CR4","volume-title":"Technical report PP-2002-02","author":"J. Boyar","year":"2002","unstructured":"J. Boyar, L. M. Favrholdt, K. S. Larsen, and M. N. Nielsen. Extending the Accommodating Function. Technical report PP-2002-02, Department of Mathematics and Computer Science, University of Southern Denmark, Odense, 2002."},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/PL00009286","volume":"25","author":"J. Boyar","year":"1999","unstructured":"J. Boyar and K. S. Larsen. The Seat Reservation Problem. Algorithmica, 25:403\u2013417, 1999.","journal-title":"Algorithmica"},{"issue":"1","key":"11_CR6","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1137\/S0097539799361786","volume":"31","author":"J. Boyar","year":"2001","unstructured":"Joan Boyar, Kim S. Larsen, and Morten N. Nielsen. The Accommodating Function: a generalization of the competitive ratio. SIAM Journal on Computing, 31(1):233\u2013258, 2001.","journal-title":"SIAM Journal on Computing"},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1002\/1099-1425(200009\/10)3:5<273::AID-JOS48>3.0.CO;2-0","volume":"3","author":"M. Brehop","year":"2000","unstructured":"M. Brehop, E. Torng, and P. Uthaisombut. Applying Extra Resource Analysis to Load Balancing. Journal of Scheduling, 3:273\u2013288, 2000.","journal-title":"Journal of Scheduling"},{"key":"11_CR8","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1051\/ita\/1988220404871","volume":"22","author":"M. Chrobak","year":"1988","unstructured":"M. Chrobak and M. Slusarek. On Some Packing Problems Related to Dynamic Storage Allocation. RAIRO Informatique Th\u00e9oretique et Applications, 22:487\u2013499, 1988.","journal-title":"RAIRO Informatique Th\u00e9oretique et Applications"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"E. Koutsoupias. Weak Adversaries for the k-Server Problem. In FOCS, pages 444\u2013449, 1999.","DOI":"10.1109\/SFFCS.1999.814616"},{"key":"11_CR10","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":"11_CR11","doi-asserted-by":"crossref","unstructured":"T. R. Jensen and B. Toft. Graph Coloring Problems. John Wiley & Sons, 1995.","DOI":"10.1002\/9781118032497"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"B. Kalyanasundaram and K. Pruhs. Speed is as powerful as clairvoyance. In FOCS, pages 214\u2013221, 1995.","DOI":"10.1109\/SFCS.1995.492478"},{"key":"11_CR13","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0012-365X(94)00285-Q","volume":"144","author":"H. A. Kierstead","year":"1995","unstructured":"H. A. Kierstead and J. Qin. Coloring Interval Graphs with First-Fit. Discrete Mathematics, 144:47\u201357, 1995.","journal-title":"Discrete Mathematics"},{"key":"11_CR14","first-page":"143","volume":"33","author":"H. A. Kierstead","year":"1981","unstructured":"H. A. Kierstead and W. T. Trotter. An Extremal Problem in Recursive Combinatorics. Congressus Numerantium, 33:143\u2013153, 1981.","journal-title":"Congressus Numerantium"},{"issue":"2","key":"11_CR15","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1016\/0196-6774(90)90003-W","volume":"11","author":"M. S. Manasse","year":"1990","unstructured":"M. S. Manasse, L. A. McGeoch, and D. D. Sleator. Competitive Algorithms for Server Problems. Journal of Algorithms, 11(2):208\u2013230, June 1990.","journal-title":"Journal of Algorithms"},{"issue":"2","key":"11_CR16","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"},{"key":"11_CR17","unstructured":"N. Young. On-Line Caching as Cache Size Varies. In SODA, pages 241\u2013250, 1991."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45655-4_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T14:32:32Z","timestamp":1737037952000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45655-4_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540439967","9783540456551"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-45655-4_11","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}