{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:10:10Z","timestamp":1763467810670},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540414131"},{"type":"electronic","value":"9783540444503"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44450-5_33","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T04:26:08Z","timestamp":1187238368000},"page":"409-420","source":"Crossref","is-referenced-by-count":13,"title":["Approximation Algorithms for Bandwidth and Storage Allocation Problems under Real Time Constraints"],"prefix":"10.1007","author":[{"given":"Stefano","family":"Leonardi","sequence":"first","affiliation":[]},{"given":"Alberto","family":"Marchetti-Spaccamela","sequence":"additional","affiliation":[]},{"given":"Andrea","family":"Vitaletti","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,11,24]]},"reference":[{"key":"33_CR1","doi-asserted-by":"crossref","unstructured":"Amotz Bar-Noy, Reuven Bar-Yehuda, Ari Freund, Joseph (Seffi) Naor, and Baruch Schieber. A unified approach to approximating resource allocation and scheduling. In Proceedings of the Thirty-Second Annual ACM Symposium on the Theory of Computing, Las Vegas, Nevada, 2000.","DOI":"10.1145\/335305.335410"},{"key":"33_CR2","doi-asserted-by":"crossref","unstructured":"Amotz Bar-Noy, Ran Canetti, Shay Kutten, Yishay Mansour, and Baruch Schieber. Bandwidth allocation with preemption. In Proceedings of the Twenty-Seventh Annual ACM Symposium on the Theory of Computing, pages 616\u2013625, Las Vegas, Nevada, 29 May-1 June 1995.","DOI":"10.1145\/225058.225279"},{"key":"33_CR3","doi-asserted-by":"crossref","unstructured":"Amotz Bar-Noy, Sudipto Guha, Joseph (Se.) Naor, and Baruch Schieber. Approximating the throughput of multiple machines under real-time scheduling. In Proceedings of the thirty-first annual ACM symposium on Theory of computing, pages 622\u2013631, Atlanta, GA USA, 1-4 May 1999.","DOI":"10.1145\/301250.301420"},{"key":"33_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1007\/3-540-61680-2_46","volume-title":"Approximation algorithms for dynamic storage allocation","author":"J. Gergov","year":"1996","unstructured":"Jordan Gergov. Approximation algorithms for dynamic storage allocation. In European Symposium on Algorithms (ESA\u201996), volume 1136 of Lecture Notes in Computer Science, pages 52\u201361. Springer, 1996."},{"key":"33_CR5","unstructured":"Jordan Gergov. Algorithms for compile-time memory optimization. In Proc. of the 10th ACM-SIAM Symposium on Discrete Algorithms, pages 907\u2013908, 1999."},{"issue":"1","key":"33_CR6","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1006\/jagm.1996.0821","volume":"23","author":"J. A. Garay","year":"1997","unstructured":"Juan A. Garay, Inder S. Gopal, and Shay Kutten. Efficient on-line call control algorithms. Journal of Algorithms, 23(1):180\u2013194, April 1997.","journal-title":"Journal of Algorithms"},{"key":"33_CR7","volume-title":"Computers and Intractability-A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson. Computers and Intractability-A Guide to the Theory of NP-Completeness. Freeman, San Francisco, 1979."},{"key":"33_CR8","doi-asserted-by":"publisher","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. Disccrete Mathematics, 88:231\u2013237, 1991.","journal-title":"Disccrete Mathematics"},{"key":"33_CR9","unstructured":"D.E. Knuth. The Art of Computer Programming, Vol. 1: Fundamental Algorithms, 2nd Edition. Addison-Wesley, 1973."},{"key":"33_CR10","doi-asserted-by":"crossref","unstructured":"M. Slusarek. A coloring algorithm for interval graphs. In Proc. of the 14th Mathematical Foundations of Computer Science, pages 471\u2013480, 1989.","DOI":"10.1007\/3-540-51486-4_93"},{"key":"33_CR11","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1002\/(SICI)1099-1425(199909\/10)2:5<215::AID-JOS27>3.0.CO;2-Y","volume":"2","author":"F.C.R. Spieksma","year":"1999","unstructured":"F.C.R. Spieksma. On the approximability of an interval scheduling problem. Journal of Scheduling, 2:215\u20132227, 1999.","journal-title":"Journal of Scheduling"}],"container-title":["Lecture Notes in Computer Science","FST TCS 2000: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44450-5_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T00:16:57Z","timestamp":1556756217000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44450-5_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540414131","9783540444503"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-44450-5_33","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}