{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:08:31Z","timestamp":1725574111292},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540407706"},{"type":"electronic","value":"9783540451983"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45198-3_15","type":"book-chapter","created":{"date-parts":[[2011,1,8]],"date-time":"2011-01-08T03:32:30Z","timestamp":1294457550000},"page":"165-177","source":"Crossref","is-referenced-by-count":10,"title":["Approximation Schemes for Generalized 2-Dimensional Vector Packing with Application to Data Placement"],"prefix":"10.1007","author":[{"given":"Hadas","family":"Shachnai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tami","family":"Tamir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","unstructured":"Chekuri, C., Khanna, S.: On Multi-dimensional Packing Problems. In: Proc. of SODA, pp. 185\u2013194 (1999)"},{"key":"15_CR2","unstructured":"Chekuri, C., Khanna, S.: A PTAS for the multiple knapsack problem. In: Proc. of SODA, pp. 213\u2013222 (2000)"},{"issue":"1","key":"15_CR3","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/0377-2217(84)90053-5","volume":"15","author":"A.M. Frieze","year":"1984","unstructured":"Frieze, A.M., Clarke, M.R.B.: Approximation Algorithms for the m-dimensional 0-1 knapsack problem: worst-case and probabilistic analyses. European J. of Operational Research\u00a015(1), 100\u2013109 (1984)","journal-title":"European J. of Operational Research"},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/322077.322090","volume":"25","author":"M.R. Garey","year":"1978","unstructured":"Garey, M.R., Johnson, D.S.: Strong NP-completeness results: Motivations, examples, and implications. J. of the ACM\u00a025, 499\u2013508 (1978)","journal-title":"J. of the ACM"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Gens, G.V., Levner, E.V.: Computational complexity of approximation algorithms for combinatorial problems. In: Proc. of the 8th Int. Symp. on Mathematical Foundations of Computer Science, pp. 292\u2013300 (1979)","DOI":"10.1007\/3-540-09526-8_26"},{"key":"15_CR6","unstructured":"Golubchik, L., Khanna, S., Khuller, S., Thurimella, R., Zhu, A.: Approximation algorithms for data placement on parallel disks. In: Proc. of SODA, pp. 223\u2013232 (2000)"},{"issue":"1","key":"15_CR7","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/S0167-8191(97)00118-X","volume":"24","author":"S. Ghandeharizadeh","year":"1998","unstructured":"Ghandeharizadeh, S., Muntz, R.R.: Design and implementation of scalable continuous media servers. Parallel Computing J.\u00a024(1), 91\u2013122 (1998)","journal-title":"Parallel Computing J."},{"issue":"4","key":"15_CR8","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/321906.321909","volume":"22","author":"O.H. Ibarra","year":"1975","unstructured":"Ibarra, O.H., Kim, C.E.: Fast Approximation for the Knapsack and the Sum of Subset Problems. J. of the ACM\u00a022(4), 463\u2013468 (1975)","journal-title":"J. of the ACM"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Kashyap, S., Khuller, S.: Algorithms for Non-Uniform Size Data Placement on Parallel Disks (2003) (submitted)","DOI":"10.1007\/978-3-540-24597-1_23"},{"key":"15_CR10","first-page":"415","volume-title":"Nonlinear Programming","author":"B. Korte","year":"1981","unstructured":"Korte, B., Schrader, R.: On the existence of fast approximation schemes. In: Magasarian, O., Meyer, R., Robinson, S. (eds.) Nonlinear Programming, vol.\u00a04, pp. 415\u2013437. Academic Press, London (1981)"},{"key":"15_CR11","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1145\/321864.321873","volume":"22","author":"S. Sahni","year":"1975","unstructured":"Sahni, S.: Approximate Algorithms for the 0\/1 knapsack problem. J. of the ACM\u00a022, 115\u2013124 (1975)","journal-title":"J. of the ACM"},{"key":"15_CR12","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/s004530010057","volume":"29","author":"H. Shachnai","year":"2001","unstructured":"Shachnai, H., Tamir, T.: On Two Class-Constrained Versions of the Multiple Knapsack Problem. Algorithmica\u00a029, 442\u2013467 (2001)","journal-title":"Algorithmica"},{"issue":"6","key":"15_CR13","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1002\/jos.86","volume":"4","author":"H. Shachnai","year":"2001","unstructured":"Shachnai, H., Tamir, T.: Polynomial Time Approximation Schemes for Class-Constrained Packing Problems. J. of Scheduling\u00a04(6), 313\u2013338 (2001)","journal-title":"J. of Scheduling"},{"key":"15_CR14","unstructured":"Shachnai, H., Tamir, T.: Approximation Schemes for Generalized 2-dimensional Vector Packing with Application to Data Placement, http:\/\/www.cs.technion.ac.il\/~hadas\/PUB\/vpsd.ps"},{"key":"15_CR15","unstructured":"Shmoys, D.S., Tardos, E.: Scheduling unrelated machines with Costs. In: Proc. of SODA (1993)"},{"issue":"6","key":"15_CR16","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/S0020-0190(97)00179-8","volume":"64","author":"G.J. Woeginger","year":"1997","unstructured":"Woeginger, G.J.: There is no asymptotic PTAS for two-dimensional vector packing. Information Processing Letters\u00a064(6), 293\u2013297 (1997)","journal-title":"Information Processing Letters"},{"key":"15_CR17","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/s005300050067","volume":"5","author":"J.L. Wolf","year":"1997","unstructured":"Wolf, J.L., Yu, P.S., Shachnai, H.: Disk load balancing for video-on-demand systems. ACM Multimedia Systems J.\u00a05, 358\u2013370 (1997)","journal-title":"ACM Multimedia Systems J."}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45198-3_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T18:05:18Z","timestamp":1559930718000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45198-3_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540407706","9783540451983"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45198-3_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}