{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,25]],"date-time":"2026-09-25T21:43:21Z","timestamp":1790372601258,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540436768","type":"print"},{"value":"9783540478676","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-47867-1_28","type":"book-chapter","created":{"date-parts":[[2007,5,23]],"date-time":"2007-05-23T14:47:17Z","timestamp":1179931637000},"page":"401-414","source":"Crossref","is-referenced-by-count":37,"title":["Improved Approximation Algorithms for Resource Allocation"],"prefix":"10.1007","author":[{"given":"Gruia","family":"Calinescu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Amit","family":"Chakrabarti","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Howard","family":"Karloff","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuval","family":"Rabani","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2002,5,21]]},"reference":[{"key":"28_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0166-218X(87)90037-0","volume":"18","author":"E. M. Arkin","year":"1987","unstructured":"E. M. Arkin, E. B. Silverberg. Scheduling jobs with fixed start and end times. Discrete Applied Mathematics, 18 (1987), 1\u20138.","journal-title":"Discrete Applied Mathematics"},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"A. Bar-Noy, R. Bar-Yehuda, A. Freund, J. Naor, B. Schieber. A unified approach to approximating resource allocation and scheduling. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (2000), 735\u2013744.","DOI":"10.1145\/335305.335410"},{"key":"28_CR3","unstructured":"A. Bar-Noy. Private communication (2001)."},{"key":"28_CR4","first-page":"501","volume":"34","author":"B. Chen","year":"2002","unstructured":"B. Chen, R. Hassin, M. Tzur. Allocation of bandwidth and storage. IIE Transactions, 34 (2002), 501\u2013507.","journal-title":"IIE Transactions"},{"key":"28_CR5","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1016\/0377-2217(94)90385-9","volume":"78","author":"N. G. Hall","year":"1994","unstructured":"N. G. Hall, M. J. Magazine. Maximizing the value of a space mission. European Journal of Operational Research, 78 (1994), 224\u2013241.","journal-title":"European Journal of Operational Research"},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"S. Leonardi, A. Marchetti-Spaccamela, A. Vitaletti. Approximation algorithms for bandwidth and storage allocation problems under real time constraints. In Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science (2000), 409\u2013420.","DOI":"10.1007\/3-540-44450-5_33"},{"key":"28_CR7","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1287\/opre.41.2.338","volume":"41","author":"J. B. Orlin","year":"1993","unstructured":"J. B. Orlin. A faster strongly polynomial minimum cost flow algorithm. Operations Research, 41 (1993), 338\u2013350.","journal-title":"Operations Research"},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"C. Phillips, R N. Uma, J. Wein. Off-line admission control for general scheduling problems. In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (2000), 879\u2013888.","DOI":"10.1002\/1099-1425(200011\/12)3:6<365::AID-JOS56>3.0.CO;2-P"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-47867-1_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T17:03:44Z","timestamp":1550336624000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-47867-1_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540436768","9783540478676"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-47867-1_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002]]}}}