{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:32:58Z","timestamp":1742913178204,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319181721"},{"type":"electronic","value":"9783319181738"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-18173-8_27","type":"book-chapter","created":{"date-parts":[[2015,5,15]],"date-time":"2015-05-15T08:47:43Z","timestamp":1431679663000},"page":"365-376","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Approximability of Two Variants of Multiple Knapsack Problems"],"prefix":"10.1007","author":[{"given":"Shuichi","family":"Miyazaki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Naoyuki","family":"Morimoto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yasuo","family":"Okabe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,5,16]]},"reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"Aerts, J., Korst, J., Spieksma, F.: Approximation of a retrieval problem for parallel disks. In: Proceedings of the 5th Italian Conference on Algorithms and Complexity (CIAC), pp. 178\u2013188 (2003)","DOI":"10.1007\/3-540-44849-7_23"},{"issue":"9","key":"27_CR2","doi-asserted-by":"publisher","first-page":"1210","DOI":"10.1109\/TC.2003.1228515","volume":"52","author":"J Aerts","year":"2003","unstructured":"Aerts, J., Korst, J., Spieksma, F., Verhaegh, W., Woeginger, G.: Random redundant storage in disk arrays: complexity of retrieval problems. IEEE Transactions on Computers 52(9), 1210\u20131214 (2003)","journal-title":"IEEE Transactions on Computers"},{"issue":"4","key":"27_CR3","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/j.ipl.2006.06.003","volume":"100","author":"R Cohen","year":"2006","unstructured":"Cohen, R., Katzir, L., Raz, D.: An efficient approximation for the generalized assignment problem. Information Processing Letters 100(4), 162\u2013166 (2006)","journal-title":"Information Processing Letters"},{"issue":"2","key":"27_CR4","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1023\/A:1009894503716","volume":"4","author":"M Dawande","year":"2000","unstructured":"Dawande, M., Kalagnanam, J., Keskinocak, P., Salman, F.S., Ravi, R.: Approximation algorithms for the multiple knapsack problem with assignment restrictions. Journal of Combinatorial Optimization 4(2), 171\u2013186 (2000)","journal-title":"Journal of Combinatorial Optimization"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"Feige, U., Vondrak, J.: Approximation algorithms for allocation problems: improving the factor of $$1-1\/e$$. In: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 667\u2013676 (2006)","DOI":"10.1109\/FOCS.2006.14"},{"issue":"3","key":"27_CR6","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1287\/moor.1110.0499","volume":"36","author":"L Fleischer","year":"2011","unstructured":"Fleischer, L., Goemans, M.X., Mirrokni, V.S., Sviridenko, M.: Tight approximation algorithms for maximum separable assignment problems. Mathematics of Operations Research 36(3), 416\u2013431 (2011)","journal-title":"Mathematics of Operations Research"},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"Karmarkar, N.: A new polynomial-time algorithm for linear programming. In: Proceedings of the 16th Annual ACM Symposium on Theory of Computing (STOC), pp. 302\u2013311 (1984)","DOI":"10.1145\/800057.808695"},{"issue":"1","key":"27_CR8","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1023\/A:1009813105532","volume":"3","author":"H Kellerer","year":"1999","unstructured":"Kellerer, H., Pferschy, U.: A new fully polynomial time approximation scheme for the knapsack problem. Journal of Combinatorial Optimization 3(1), 59\u201371 (1999)","journal-title":"Journal of Combinatorial Optimization"},{"issue":"1\u20132","key":"27_CR9","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kuhn","year":"1955","unstructured":"Kuhn, H.W.: The hungarian method for the assignment problem. Naval Research Logistics Quarterly 2(1\u20132), 83\u201397 (1955)","journal-title":"Naval Research Logistics Quarterly"},{"issue":"3","key":"27_CR10","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0377-2217(81)90175-2","volume":"8","author":"MJ Magazine","year":"1981","unstructured":"Magazine, M.J., Oguz, O.: A fully polynomial approximation algorithm for the 0\u20131 knapsack problem. European Journal of Operational Research 8(3), 270\u2013273 (1981)","journal-title":"European Journal of Operational Research"},{"key":"27_CR11","unstructured":"Murty, K.G.: Network Programming. Prentice-Hall, Inc (1992)"},{"issue":"3","key":"27_CR12","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/j.orl.2005.05.006","volume":"34","author":"Z Nutov","year":"2006","unstructured":"Nutov, Z., Beniaminy, I., Yuster, R.: A ($$1-1\/e$$)-approximation algorithm for the generalized assignment problem. Operations Research Letters 34(3), 283\u2013288 (2006)","journal-title":"Operations Research Letters"},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"Sakai, K., Okabe, Y.: Quality-aware energy routing toward on-demand home energy networking. In: Proceeding of the 2011 IEEE Consumer Communications and Networking Conference (CCNC), pp. 1041\u20131044 (2011)","DOI":"10.1109\/CCNC.2011.5766324"},{"issue":"1\u20133","key":"27_CR14","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/BF01585178","volume":"62","author":"DB Shmoys","year":"1993","unstructured":"Shmoys, D.B., Tardos, \u00c9.: An approximation algorithm for the generalized assignment problem. Mathematical Programming 62(1\u20133), 461\u2013474 (1993)","journal-title":"Mathematical Programming"},{"issue":"5","key":"27_CR15","doi-asserted-by":"publisher","first-page":"717","DOI":"10.3390\/en4050717","volume":"4","author":"T Takuno","year":"2011","unstructured":"Takuno, T., Kitamori, Y., Takahashi, R., Hikihara, T.: AC power routing system in home based on demand and supply utilizing distributed power sources. Energies 4(5), 717\u2013726 (2011)","journal-title":"Energies"},{"key":"27_CR16","doi-asserted-by":"crossref","unstructured":"Zuckerman, D.: Linear degree extractors and the inapproximability of max clique and chromatic number. In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC), pp. 681\u2013690 (2006)","DOI":"10.1145\/1132516.1132612"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-18173-8_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T08:56:10Z","timestamp":1676451370000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-18173-8_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319181721","9783319181738"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-18173-8_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"16 May 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}