{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T04:09:29Z","timestamp":1751688569894,"version":"3.41.0"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Scheduling"],"published-print":{"date-parts":[[2003,3]]},"DOI":"10.1023\/a:1022985808959","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T22:16:51Z","timestamp":1049753811000},"page":"131-147","source":"Crossref","is-referenced-by-count":10,"title":["Tight Bounds on the Competitive Ratio on Accommodating Sequences for the Seat Reservation Problem"],"prefix":"10.1007","volume":"6","author":[{"given":"Eric","family":"Bach","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joan","family":"Boyar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leah","family":"Epstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lene M.","family":"Favrholdt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tao","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kim S.","family":"Larsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guo-Hui","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rob","family":"van Stee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5117036_CR1","unstructured":"Awerbuch, B., Y. Bartal, A. Fiat, and A. Ros\u00e9n, \u201cCompetitive non-preemptive call control,\u201d in Proc. 5th Annu. ACM-SIAM Symp. on Discrete Algorithms, ACM Press, 1994, pp. 312-320."},{"key":"5117036_CR2","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Y. Bartal, A. Fiat, S. Leonardi, and A. Ros\u00e9n, \u201cOn-line competitive algorithms for call admission in optical networks,\u201d in Proc. 4th Annu. Eur. Symp. on Algorithms, Lecture Notes in Computer Science 1136, Springer-Verlag, 1996, pp. 431-444.","DOI":"10.1007\/3-540-61680-2_73"},{"key":"5117036_CR3","unstructured":"Bach, E., J. Boyar, and K.S. Larsen, The Accommodating Ratio for the Seat Reservation Problem, PP-1997-25, Department of Mathematics and Computer Science, University of Southern Denmark, 1997."},{"key":"5117036_CR4","doi-asserted-by":"crossref","unstructured":"Bach, E., J. Boyar, T. Jiang, K.S. Larsen, and G.-H. Lin, \u201cBetter bounds on the accommodating ratio for the seat reservation problem,\u201d in Proc. 6th Annu. Int. Computing and Combinatorics Conference, Lecture Notes in Computer Science 1858, Springer-Verlag, 2000, pp. 221-231.","DOI":"10.1007\/3-540-44968-X_22"},{"key":"5117036_CR5","doi-asserted-by":"crossref","unstructured":"Bar-Noy, A., R. Canetti, S. Kutten, Y. Mansour, and B. Schieber, \u201cBandwidth allocation with preemption,\u201d in Proc. 27th Annu. ACM Symp. on Theory of Computing, ACM Press, 1995, pp. 616-625.","DOI":"10.1145\/225058.225279"},{"key":"5117036_CR6","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1007\/PL00009286","volume":"25","author":"J. Boyar","year":"1999","unstructured":"Boyar, J. and K.S. Larsen, \u201cThe seat reservation problem,\u201d Algorithmica, 25, 403-417 (1999). Full paper to appear in SIAM J. Computing.","journal-title":"Algorithmica"},{"key":"5117036_CR7","doi-asserted-by":"crossref","unstructured":"Boyar, J., K.S. Larsen, and M.N. Nielsen, \u201cThe accommodating function\u2014a generalization of the competitive ratio,\u201d in Proc. 6th Int. Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science 1663, Springer-Verlag, 1999, pp. 74-79.","DOI":"10.1007\/3-540-48447-7_9"},{"key":"5117036_CR8","doi-asserted-by":"crossref","unstructured":"Carlisle, M.C. and E. L. Lloyd, \u201cOn the k-coloring of intervals,\u201d in Advances in Computing and Information, Lecture Notes in Computer Science 497, Springer-Verlag, 1991, pp. 90-101.","DOI":"10.1007\/3-540-54029-6_157"},{"key":"5117036_CR9","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1006\/jagm.1996.0821","volume":"23","author":"J. A. Garay","year":"1997","unstructured":"Garay, J. A., I. S. Gopal, S. Kutten, Y. Mansour, and M. Yung, \u201cEfficient on-line call control algorithms,\u201d J. Algorithms, 23, 180-194 (1997).","journal-title":"J. Algorithms"},{"key":"5117036_CR10","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1137\/0201013","volume":"1","author":"F. Gavril","year":"1972","unstructured":"Gavril, F., \u201cAlgorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph,\u201d SIAM J. Computing,\n1, 180-187 (1972).","journal-title":"SIAM J. Computing"},{"key":"5117036_CR11","doi-asserted-by":"crossref","unstructured":"Jensen, T. R. and B. Toft, Graph Coloring Problems, Wiley, 1995.","DOI":"10.1002\/9781118032497"},{"key":"5117036_CR12","first-page":"143","volume":"33","author":"H. A. Kierstead","year":"1981","unstructured":"Kierstead, H. A. and W. T. Trotter Jr, \u201cAn extremal problem in recursive combinatorics,\u201d Congressus Numerantium, 33, 143-153 (1981).","journal-title":"Congressus Numerantium"},{"key":"5117036_CR13","unstructured":"Lipton, R. J. and A. Tomkins, \u201cOn-line interval scheduling,\u201d in Proc. 5th Annu. ACM-SIAM Symp. on Discrete Algorithms, ACM Press, 1994, pp. 302-311."},{"key":"5117036_CR14","doi-asserted-by":"crossref","unstructured":"Raghavan, P. and E. Upfal, \u201cEfficient routing in all-optical networks,\u201d in Proc. 26th Annu. ACM Symp. on Theory of Computing, ACM Press, 1994, pp. 134-143.","DOI":"10.1145\/195058.195119"},{"key":"5117036_CR15","series-title":"Working paper","volume-title":"Exact and approximation algorithms for the operational fixed interval scheduling problem","author":"L. van Wassenhove","year":"1992","unstructured":"van Wassenhove, L., L. Kroon, and M. Salomon, \u201cExact and approximation algorithms for the operational fixed interval scheduling problem,\u201d Working paper 92\/08\/TM, INSEAD, Fontainebleau, France, 1992."}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1022985808959.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1022985808959\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1022985808959.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T12:51:35Z","timestamp":1751633495000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1022985808959"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,3]]}},"alternative-id":["5117036"],"URL":"https:\/\/doi.org\/10.1023\/a:1022985808959","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"type":"print","value":"1094-6136"},{"type":"electronic","value":"1099-1425"}],"subject":[],"published":{"date-parts":[[2003,3]]}}}