{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:47:32Z","timestamp":1725551252096},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540633976"},{"type":"electronic","value":"9783540695363"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63397-9_29","type":"book-chapter","created":{"date-parts":[[2010,4,5]],"date-time":"2010-04-05T15:22:48Z","timestamp":1270480968000},"page":"378-387","source":"Crossref","is-referenced-by-count":3,"title":["Dynamic storage allocation with known durations"],"prefix":"10.1007","author":[{"given":"Joseph","family":"Naor","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ariel","family":"Orda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yael","family":"Petruschka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,7,30]]},"reference":[{"key":"29_CR1","doi-asserted-by":"crossref","unstructured":"B. Awerbuch, Y. Azar, and S. Plotkin. Throughput-competitive of on-line routing. In Proc. 30th IEEE Symp. on Foundations of Computer Science, pages 32\u201340, October 1993.","DOI":"10.1109\/SFCS.1993.366884"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"Y. Azar, B. Kalyanasundaram, S. Plotkin, K. R. Pruhs, and O. Waarts. On-line load balancing of temporary tasks. In Proc. Workshop on Algorithms and Data Structures, August 1993.","DOI":"10.1007\/3-540-57155-8_241"},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"A. Bar-Noy, R. Canetti, S. Kutten, Y. Mansour, and B. Schieber. Bandwidth allocation with preemption. In Proc. 27th ACM Symp. on Theory of Computing, 1995.","DOI":"10.1145\/225058.225279"},{"key":"29_CR4","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1137\/1025074","volume":"25","author":"E. G. Coffman","year":"1983","unstructured":"E. G. Coffman. An introduction to combinatorial models of dynamic storage allocation. SIAM Review, 25:311\u2013325, 1983.","journal-title":"SIAM Review"},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"J. Gergov. Approximation algorithms for dynamic storage allocation. In Proc. of the 4th Annual European Symposium on Algorithms, pages 52\u201361, 1996.","DOI":"10.1007\/3-540-61680-2_46"},{"key":"29_CR6","unstructured":"M. R. Garey and D. S. Johnson. Computers and intractability-a guide to the theory of NP-completeness. W. H. Freeman, San Francisco, 1979."},{"key":"29_CR7","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1137\/0401048","volume":"1","author":"H. A. Kierstead","year":"1988","unstructured":"H. A. Kierstead. The linearity of first-fit coloring of interval graphs. SIAM Journal on Discrete Math, 1:526\u2013530, 1988.","journal-title":"SIAM Journal on Discrete Math"},{"key":"29_CR8","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0012-365X(91)90011-P","volume":"88","author":"H. A. Kierstead","year":"1991","unstructured":"H. A. Kierstead. A polynomial time approximation algorithm for dynamic storage allocation. Discrete Mathematics, 88:231\u2013237, 1991.","journal-title":"Discrete Mathematics"},{"key":"29_CR9","unstructured":"D. E. Knuth. Fundamental algorithms, volume 1. Addison-Wesley, Reading, MA, second edition, 1973."},{"issue":"1","key":"29_CR10","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1137\/S089548019325647X","volume":"9","author":"M. G. Luby","year":"1996","unstructured":"M. G. Luby, J. Naor, and A. Orda. Tight bounds for dynamic storage allocation. SIAM Journal on Discrete Math, 9(1):155\u2013166, 1996.","journal-title":"SIAM Journal on Discrete Math"},{"key":"29_CR11","unstructured":"C. Partridge. Gigabit Networking. Addison-Wesley, 1994."},{"key":"29_CR12","first-page":"139","volume-title":"Proof Techniques in Graph Theory","author":"F. S. Roberts","year":"1969","unstructured":"F. S. Roberts. Indifference graphs. In F. Harary, editor, Proof Techniques in Graph Theory, pages 139\u2013146. Academic Press, N.Y., 1969."},{"key":"29_CR13","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1145\/321650.321658","volume":"18","author":"J. M. Robson","year":"1971","unstructured":"J. M. Robson. An estimate of the store size necessary for dynamic storage allocation. Journal of the ACM, 18:416\u2013423, 1971.","journal-title":"Journal of the ACM"},{"key":"29_CR14","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1145\/321832.321846","volume":"12","author":"J. M. Robson","year":"1974","unstructured":"J. M. Robson. Bounds for some functions concerning dynamic storage allocation. Journal of the ACM, 12:491\u2013499, 1974.","journal-title":"Journal of the ACM"},{"key":"29_CR15","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1093\/comjnl\/20.3.242","volume":"20","author":"J. M. Robson","year":"1977","unstructured":"J. M. Robson. Worst case fragmentation of first fit and best fit storage allocation strategies. Computer Journal, 20:242\u2013244, 1977.","journal-title":"Computer Journal"},{"issue":"3","key":"29_CR16","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1109\/90.311625","volume":"2","author":"O. Sharon","year":"1994","unstructured":"O. Sharon and A. Segal. Schemes for slot reuse in CRMA. IEEE\/ACM Transactions on Networking, 2(3):269\u2013278, 1994.","journal-title":"Transactions on Networking"},{"key":"29_CR17","unstructured":"T. A. Standish. Data structures, algorithms and software principles in C. Addison-Wesley, Reading, MA, second edition, 1995."}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2014 ESA '97"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63397-9_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,21]],"date-time":"2019-01-21T06:33:59Z","timestamp":1548052439000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63397-9_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540633976","9783540695363"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-63397-9_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}