{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:22:23Z","timestamp":1725488543561},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540401766"},{"type":"electronic","value":"9783540448495"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44849-7_23","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T10:26:17Z","timestamp":1186741577000},"page":"178-188","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Approximation of a Retrieval Problem for Parallel Disks"],"prefix":"10.1007","author":[{"given":"Joep","family":"Aerts","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Korst","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frits","family":"Spieksma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,5,13]]},"reference":[{"key":"23_CR1","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1287\/moor.23.2.359","volume":"23","author":"W.P. Adams","year":"1998","unstructured":"Adams, W.P., J. Bowers Lassiter, and H.D. Sherali (1998), Persistency in 0\u20131 polynomial programming, Mathematics of Operations Research 23, 359\u2013389.","journal-title":"Mathematics of Operations Research"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Aerts, J., J. Korst, F. Spieksma, W. Verhaegh, and G. Woeginger (2002), Load balancing in disk arrays: complexity of retrieval problems, to appear in IEEE Transactions on Computers.","DOI":"10.1109\/TC.2003.1228515"},{"key":"23_CR3","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1002\/jos.81","volume":"4","author":"J. Aerts","year":"2001","unstructured":"Aerts, J., J. Korst, and W. Verhaegh (2001), Load balancing for redundant storage strategies: Multiprocessor scheduling with machine eligibility, Journal of Scheduling 4, 245\u2013257.","journal-title":"Journal of Scheduling"},{"key":"23_CR4","unstructured":"Aerts, J., J. Korst, and W. Verhaegh (2002), Improving disk efficiency in video servers by random redundant storage, To appear in the Proceedings of the 6th IASTED International Conference on Internet and Multimedia Systems and Applications (August 2002)."},{"key":"23_CR5","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/S0167-6377(99)00056-5","volume":"25","author":"F. Chudak","year":"1999","unstructured":"Chudak, F. and D.S. Hochbaum, (1999), A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine, Operations Research Letters 25, 199\u2013204.","journal-title":"Operations Research Letters"},{"key":"23_CR6","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1023\/A:1009894503716","volume":"4","author":"M. Dawande","year":"2000","unstructured":"Dawande, M., J. Kalagnanam, P. Keskinocak, F.S. Salman, and R. Ravi (2000), Approximation algorithms for the multiple knapsack problem with assignment restrictions, Journal of Combinatorial Optimization 4, 171\u2013186.","journal-title":"Journal of Combinatorial Optimization"},{"key":"23_CR7","unstructured":"Golubchik, L., S. Khanna, S. Khuller, R. Thurimella, and A. Zhu (2000), Approximation algorithms for data placement on parallel disks, Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms, pp. 223\u2013232, New York."},{"key":"23_CR8","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/S0377-2217(02)00071-1","volume":"140","author":"D.S. Hochbaum","year":"2002","unstructured":"Hochbaum, D.S. (2002), Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations, European Journal of Operational Research 140, 291\u2013321.","journal-title":"European Journal of Operational Research"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Korst, J. (1997), Random duplicated Assignment: An alternative to striping in video servers, Proceedings of the ACM Multimedia Conference, pp. 219\u2013226, Seattle.","DOI":"10.1145\/266180.266372"},{"key":"23_CR10","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/BF01580444","volume":"8","author":"G.L. Nemhauser","year":"1975","unstructured":"Nemhauser, G.L. and L.E. Trotter, Jr. (1975), Vertex packings: structural properties and algorithms, Mathematical Programming 8, 232\u2013248.","journal-title":"Mathematical Programming"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Papadopouli, M. and L. Golubchik (1998), A scalable video-on-demand server for a dynamic heterogeneous environment, Proceedings of the 4th International Workshop on Advances in Multimedia Information Systems, 4\u201317.","DOI":"10.1007\/3-540-49651-3_3"},{"key":"23_CR12","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0167-6377(93)90021-8","volume":"14","author":"T.K. Ralphs","year":"1993","unstructured":"Ralphs, T.K. (1993), On the mixed chinese postman problem, Operations Research Letters 14, 123\u2013127.","journal-title":"Operations Research Letters"},{"key":"23_CR13","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1109\/2.268881","volume":"27","author":"C. Ruemmler","year":"1994","unstructured":"Ruemmler, C. and J. Wilkes (1994), An introduction to disk drive modeling, IEEE Computer 27, 17\u201328.","journal-title":"IEEE Computer"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Sanders, P. (2000), Asynchronous scheduling for redundant disk arrays, Proceedings of the 12th ACM Symposium on Parallel Algorithms and Architectures, 98\u2013108.","DOI":"10.1145\/341800.341812"},{"key":"23_CR15","unstructured":"Sanders, P. (2001), Reconciling simplicity and realism in parallel disk models, Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms, 67\u201376."},{"key":"23_CR16","unstructured":"Sanders, P., S. Egner and J. Korst (2000), Fast concurrent access to parallel disks Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms, 849\u2013858."},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"Santos, J., R. Muntz, and B. Ribeiro-Neto (2000), Comparing random data allocation and data striping in multimedia servers, Proceedings of the ACM Sigmetrics conference on measurements and modelling of computer systems, 44\u201355.","DOI":"10.1145\/345063.339352"},{"key":"23_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/384192.384193","volume":"33","author":"J.S. Vitter","year":"2001","unstructured":"Vitter, J.S. (2001), External memory algorithms and data structures: Dealing with massive data, ACM Computing Surveys 33, 1\u201375.","journal-title":"ACM Computing Surveys"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44849-7_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T14:07:34Z","timestamp":1558274854000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44849-7_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540401766","9783540448495"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-44849-7_23","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]},"assertion":[{"value":"13 May 2003","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}