{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T06:52:17Z","timestamp":1725864737539},"publisher-location":"Cham","reference-count":8,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319455860"},{"type":"electronic","value":"9783319455877"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-45587-7_13","type":"book-chapter","created":{"date-parts":[[2016,9,9]],"date-time":"2016-09-09T04:01:21Z","timestamp":1473393681000},"page":"148-159","source":"Crossref","is-referenced-by-count":1,"title":["Approximability and Exact Resolution of the Multidimensional Binary Vector Assignment Problem"],"prefix":"10.1007","author":[{"given":"Marin","family":"Bougeret","sequence":"first","affiliation":[]},{"given":"Guillerme","family":"Duvilli\u00e9","sequence":"additional","affiliation":[]},{"given":"Rodolphe","family":"Giroudeau","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,10]]},"reference":[{"issue":"3","key":"13_CR1","doi-asserted-by":"crossref","first-page":"719","DOI":"10.1016\/j.ejor.2005.06.006","volume":"172","author":"G Ausiello","year":"2006","unstructured":"Ausiello, G., Paschos, V.T.: Reductions, completeness and the hardness of approximability. Eur. J. Oper. Res. 172(3), 719\u2013739 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1007\/978-3-642-14165-2_22","volume-title":"Automata, Languages and Programming","author":"N Bansal","year":"2010","unstructured":"Bansal, N., Khot, S.: Inapproximability of hypergraph vertex cover and applications to scheduling problems. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6198, pp. 250\u2013261. Springer, Heidelberg (2010)"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Bougeret, M., Duvilli\u00e9, G., Giroudeau, R.: Approximability and exact resolution of the multidimensional binary vector assignment problem. Research report, Lirmm; Universit\u00e9 de Montpellier, HAL id: lirmm-01310648, May 2016","DOI":"10.1007\/978-3-319-45587-7_13"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1007\/978-3-642-38016-7_23","volume-title":"Approximation and Online Algorithms","author":"T Dokka","year":"2013","unstructured":"Dokka, T., Bougeret, M., Boudet, V., Giroudeau, R., Spieksma, F.C.R.: Approximation algorithms for the wafer to wafer integration problem. In: Erlebach, T., Persiano, G. (eds.) WAOA 2012. LNCS, vol. 7846, pp. 286\u2013297. Springer, Heidelberg (2013)"},{"key":"13_CR5","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/j.disopt.2014.08.005","volume":"14","author":"T Dokka","year":"2014","unstructured":"Dokka, T., Crama, Y., Spieksma, F.C.: Multi-dimensional vector assignment problems. Discrete Optim. 14, 111\u2013125 (2014)","journal-title":"Discrete Optim."},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1007\/978-3-319-18173-8_15","volume-title":"Algorithms and Complexity","author":"G Duvilli\u00e9","year":"2015","unstructured":"Duvilli\u00e9, G., Bougeret, M., Boudet, V., Dokka, T., Giroudeau, R.: On the complexity of wafer-to-wafer integration. In: Paschos, V.T., Widmayer, P. (eds.) CIAC 2015. LNCS, vol. 9079, pp. 208\u2013220. Springer, Heidelberg (2015)"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C., Yannakakis, M.: Optimization, approximation, and complexity classes. In: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, pp. 229\u2013234. ACM (1988)","DOI":"10.1145\/62212.62233"},{"issue":"9","key":"13_CR8","doi-asserted-by":"crossref","first-page":"1357","DOI":"10.1109\/TVLSI.2008.2003513","volume":"17","author":"S Reda","year":"2009","unstructured":"Reda, S., Smith, G., Smith, L.: Maximizing the functional yield of wafer-to-wafer 3-D integration. IEEE Trans. Very Large Scale Integr. (VLSI) Syst. 17(9), 1357\u20131362 (2009)","journal-title":"IEEE Trans. Very Large Scale Integr. (VLSI) Syst."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-45587-7_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,13]],"date-time":"2019-09-13T08:48:37Z","timestamp":1568364517000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-45587-7_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319455860","9783319455877"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-45587-7_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}