{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:36:06Z","timestamp":1725564966694},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540228561"},{"type":"electronic","value":"9783540277989"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27798-9_37","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T19:01:28Z","timestamp":1283713288000},"page":"339-348","source":"Crossref","is-referenced-by-count":3,"title":["New Approximation Algorithms for Some Dynamic Storage Allocation Problems"],"prefix":"10.1007","author":[{"given":"Shuai Cheng","family":"Li","sequence":"first","affiliation":[]},{"given":"Hon Wai","family":"Leong","sequence":"additional","affiliation":[]},{"given":"Steven K.","family":"Quek","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"37_CR1","volume-title":"Computers and Intractability \u2013 A guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability \u2013 A guide to the Theory of NP-Completeness. Freeman, New York (1979)"},{"key":"37_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1007\/3-540-61680-2_46","volume-title":"Algorithms - ESA \u201996","author":"J. Gergov","year":"1996","unstructured":"Gergov, J.: Approximation algorithms for dynamic storage allocation. In: D\u00edaz, J. (ed.) ESA 1996. LNCS, vol.\u00a01136, pp. 52\u201361. Springer, Heidelberg (1996)"},{"key":"37_CR3","unstructured":"Gergov, J.: Algorithms for Compile-Time Memory Optimization. In: ACM-SIAM Symposium on Discrete Algorithms, pp. 907\u2013908 (1999)"},{"key":"37_CR4","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1137\/0401048","volume":"1","author":"H.A. Kierstead","year":"1988","unstructured":"Kierstead, H.A.: The linearity of first-fit coloring of interval graphs. SIAM J. Disc. Math.\u00a01, 526\u2013530 (1988)","journal-title":"SIAM J. Disc. Math."},{"key":"37_CR5","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0012-365X(91)90011-P","volume":"88","author":"H.A. Kierstead","year":"1991","unstructured":"Kierstead, H.A.: A polynomial time approximation algorithm for Dynamic Storage Allocation. Discrete Mathematics\u00a088, 231\u2013237 (1991)","journal-title":"Discrete Mathematics"},{"key":"37_CR6","volume-title":"Fundamental Algorithms: The art of computer programming","author":"D.E. Knuth","year":"1973","unstructured":"Knuth, D.E.: Fundamental Algorithms: The art of computer programming, vol.\u00a01. Addison-Wesley Pub., Reading (1973)"},{"key":"37_CR7","unstructured":"Li, S.C.: Algorithms for Berth Allocation Problem, M.Sc Thesis, Department of Computer Science, National University of Singapore (2002)"},{"key":"37_CR8","first-page":"491","volume":"12","author":"M.G. Ludy","year":"1974","unstructured":"Ludy, M.G., Naor, J., Orda, A.: Tight Bounds for Dynamic Storage Allocation. J. ACM\u00a012, 491\u2013499 (1974)","journal-title":"J. ACM"},{"key":"37_CR9","unstructured":"Murthy, P.K., Bhattacharyya, S.S.: Approximation algorithms and heuristics for dynamic storage allocation problem. UMIACS TR-99-31, University of Maryland, College Park (1999)"},{"issue":"3","key":"37_CR10","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1145\/321832.321846","volume":"21","author":"J.M. Robson","year":"1974","unstructured":"Robson, J.M.: Bounds for some functions concerning dynamic storage allocation. Journal of the ACM\u00a021(3), 491\u2013499 (1974)","journal-title":"Journal of the ACM"},{"key":"37_CR11","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1093\/comjnl\/20.3.242","volume":"20","author":"J.M. Robson","year":"1977","unstructured":"Robson, J.M.: Worst base fragmentation of first fit and best fit storage allocation strategies. Computer Journal\u00a020, 242\u2013244 (1977)","journal-title":"Computer Journal"},{"key":"37_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1007\/3-540-51486-4_93","volume-title":"Mathematical Foundations of Computer Science 1989","author":"M. Slusarek","year":"1989","unstructured":"Slusarek, M.: A Coloring Algorithm for Interval Graphs. In: Kreczmar, A., Mirkowska, G. (eds.) MFCS 1989. LNCS, vol.\u00a0379, pp. 471\u2013480. Springer, Heidelberg (1989)"},{"key":"37_CR13","series-title":"Lecture Notes in Computer Science","volume-title":"Memory Management","author":"P.R. Wilson","year":"1995","unstructured":"Wilson, P.R., Johnstone, M.S., Neely, M., Boles, D.: Dynamic storage allocation: A survey and critical review. In: Baker, H.G. (ed.) IWMM-GIAE 1995. LNCS, vol.\u00a0986. Springer, Heidelberg (1995)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27798-9_37.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,2]],"date-time":"2021-05-02T23:26:36Z","timestamp":1619997996000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27798-9_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228561","9783540277989"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27798-9_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}