{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:21:00Z","timestamp":1740122460768,"version":"3.37.3"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,3,29]],"date-time":"2018-03-29T00:00:00Z","timestamp":1522281600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100008222","name":"Universit\u00e9 de Montpellier","doi-asserted-by":"publisher","award":["LIRMM"],"award-info":[{"award-number":["LIRMM"]}],"id":[{"id":"10.13039\/501100008222","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008367","name":"Universit\u00e9 Libre de Bruxelles","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100008367","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1007\/s10878-018-0276-8","type":"journal-article","created":{"date-parts":[[2018,4,3]],"date-time":"2018-04-03T22:10:59Z","timestamp":1522793459000},"page":"1059-1073","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Approximability and exact resolution of the multidimensional binary vector assignment problem"],"prefix":"10.1007","volume":"36","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":[[2018,3,29]]},"reference":[{"issue":"1\u20132","key":"276_CR1","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0304-3975(98)00158-3","volume":"237","author":"P Alimonti","year":"2000","unstructured":"Alimonti P, Kann V (2000) Some APX-completeness results for cubic graphs. Theor Comput Sci 237(1\u20132):123\u2013134","journal-title":"Theor Comput Sci"},{"key":"276_CR2","doi-asserted-by":"crossref","unstructured":"Bansal N, Khot S (2010) Inapproximability of hypergraph vertex cover and applications to scheduling problems. In: International Colloquium on Automata, Languages and Programming (ICALP), pp 250\u2013261","DOI":"10.1007\/978-3-642-14165-2_22"},{"key":"276_CR3","doi-asserted-by":"crossref","unstructured":"Crescenzi P (1997) A short guide to approximation preserving reductions. In: Proceedings of the twelfth annual IEEE conference on computational complexity, Ulm, Germany, June 24\u201327, 1997, pp 262\u2013273","DOI":"10.1109\/CCC.1997.612321"},{"key":"276_CR4","doi-asserted-by":"crossref","unstructured":"Dokka T, Bougeret M, Boudet V, Giroudeau R, Spieksma FC (2013) Approximation algorithms for the wafer to wafer integration problem. In: Approximation and online algorithms (WAOA). Springer, pp 286\u2013297","DOI":"10.1007\/978-3-642-38016-7_23"},{"key":"276_CR5","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.disopt.2014.08.005","volume":"14","author":"T Dokka","year":"2014","unstructured":"Dokka T, Crama Y, Spieksma FC (2014) Multi-dimensional vector assignment problems. Discrete Optim 14:111\u2013125","journal-title":"Discrete Optim"},{"key":"276_CR6","doi-asserted-by":"crossref","unstructured":"Duvilli\u00e9 G, Bougeret M, Boudet V, Dokka T, Giroudeau R (2015) On the complexity of wafer-to-wafer integration. In: International conference on algorithms and complexity (CIAC), pp 208\u2013220","DOI":"10.1007\/978-3-319-18173-8_15"},{"key":"276_CR7","doi-asserted-by":"crossref","unstructured":"Papadimitriou C, Yannakakis M (1988) Optimization, approximation, and complexity classes. In: Proceedings of the twentieth annual ACM symposium on theory of computing. ACM, pp 229\u2013234","DOI":"10.1145\/62212.62233"},{"issue":"9","key":"276_CR8","doi-asserted-by":"publisher","first-page":"1357","DOI":"10.1109\/TVLSI.2008.2003513","volume":"17","author":"S Reda","year":"2009","unstructured":"Reda S, Smith G, Smith L (2009) Maximizing the functional yield of wafer-to-wafer 3-d integration. IEEE Trans Very Large Scale Integr VLSI Syst 17(9):1357\u20131362","journal-title":"IEEE Trans Very Large Scale Integr VLSI Syst"},{"key":"276_CR9","volume-title":"Approximation algorithms","author":"VV Vazirani","year":"2001","unstructured":"Vazirani VV (2001) Approximation algorithms. Springer, Berlin"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-018-0276-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0276-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0276-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,28]],"date-time":"2019-03-28T20:12:27Z","timestamp":1553803947000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-018-0276-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,29]]},"references-count":9,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,10]]}},"alternative-id":["276"],"URL":"https:\/\/doi.org\/10.1007\/s10878-018-0276-8","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2018,3,29]]},"assertion":[{"value":"29 March 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}