{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:21:45Z","timestamp":1725492105294},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540439776"},{"type":"electronic","value":"9783540456438"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45643-0_5","type":"book-chapter","created":{"date-parts":[[2007,9,25]],"date-time":"2007-09-25T00:58:33Z","timestamp":1190681913000},"page":"60-70","source":"Crossref","is-referenced-by-count":0,"title":["Evaluating the Local Ratio Algorithm for Dynamic Storage Allocation"],"prefix":"10.1007","author":[{"given":"Kirk","family":"Pruhs","sequence":"first","affiliation":[]},{"given":"Eric","family":"Wiewiora","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,7,12]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"A. Barnoy, R. Bar-Yehuda, A. Freund, J. Naor, and B. Schieber, \u201dA unified approach to approximating resource allocation and scheduling\u201d, ACM Symposium on Theory of Computing, 2000. To appear in JACM.","DOI":"10.1145\/335305.335410"},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1137\/1025074","volume":"25","author":"E. Coffman","year":"1999","unstructured":"E. Coffman, \u201cAn introduction to combinatorial models of dynamic storage allocation\u201d, SIAM Review, 25, 311\u2013325, 1999.","journal-title":"SIAM Review"},{"key":"5_CR3","unstructured":"J. Gergov, \u201cAlgorithms for compile-time memory allocation\u201d, ACM\/SIAM Symposium on Discrete Algorithms, S907\u2013S908, 1999."},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0012-365X(91)90011-P","volume":"88","author":"H. Kierstead","year":"1991","unstructured":"H. Kierstead, \u201cA polynomial time approximation algorithm for dynamic storage allocation\u201d, Discrete Mathematics, 88, 231\u2013237, 1991.","journal-title":"Discrete Mathematics"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"S. Leonardi, A. Marchetti-Spaccamela and A. Vitaletti, \u201cApproximation algorithms for bandwidth and storage allocation problems under real time constraints\u201d, Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), 2000.","DOI":"10.1007\/3-540-44450-5_33"},{"key":"5_CR6","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"International Workshop on Memory Management","author":"P. Wilson","year":"1995","unstructured":"P. Wilson, M. Johnstone, M. Neely, and D. Boles, \u201cDynamic storage allocation: a survey and critical review\u201d, International Workshop on Memory Management, Lecture Notes in Computer Science, 986, 1\u2013116, 1995."}],"container-title":["Lecture Notes in Computer Science","Algorithm Engineering and Experiments"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45643-0_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T07:53:39Z","timestamp":1556870019000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45643-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540439776","9783540456438"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-45643-0_5","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}