{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T20:09:44Z","timestamp":1743106184459,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"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_15","type":"book-chapter","created":{"date-parts":[[2015,5,15]],"date-time":"2015-05-15T08:47:43Z","timestamp":1431679663000},"page":"208-220","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["On the Complexity of Wafer-to-Wafer Integration"],"prefix":"10.1007","author":[{"given":"Guillerme","family":"Duvilli\u00e9","sequence":"first","affiliation":[]},{"given":"Marin","family":"Bougeret","sequence":"additional","affiliation":[]},{"given":"Vincent","family":"Boudet","sequence":"additional","affiliation":[]},{"given":"Trivikram","family":"Dokka","sequence":"additional","affiliation":[]},{"given":"Rodolphe","family":"Giroudeau","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,5,16]]},"reference":[{"issue":"5","key":"15_CR1","doi-asserted-by":"publisher","first-page":"1759","DOI":"10.1137\/S0097539796304220","volume":"28","author":"P Crescenzi","year":"1999","unstructured":"Crescenzi, P., Kann, V., Silvestri, R., Trevisan, L.: Structure in approximation classes. SIAM Journal on Computing 28(5), 1759\u20131782 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Cygan, M.: Improved approximation for 3-dimensional matching via bounded pathwidth local search. In: 2013 IEEE 54th Annual Symposium on Foundations of Computer Science (FOCS), pp. 509\u2013518. IEEE (2013)","DOI":"10.1109\/FOCS.2013.61"},{"key":"15_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"15_CR4","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, F.C.R.: Multi-dimensional vector assignment problems. Discrete Optimization 14, 111\u2013125 (2014)","journal-title":"Discrete Optimization"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Duvilli\u00e9, G., Bougeret, M., Boudet, V., Dokka, T., Giroudeau, R.: On the complexity of Wafer-to-Wafer Integration. Research report, Lirmm; UM II montpellier, Facult\u00e9 des Sciences et Techniques du Languedoc, January 2015. HAL id:lirmm-01110027","DOI":"10.1007\/978-3-319-18173-8_15"},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-540-45198-3_8","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"E Hazan","year":"2003","unstructured":"Hazan, E., Safra, S., Schwartz, O.: On the complexity of approximating k-dimensional matching. In: Arora, S., Jansen, K., Rolim, J.D.P., Sahai, A. (eds.) RANDOM 2003 and APPROX 2003. LNCS, vol. 2764, pp. 83\u201397. Springer, Heidelberg (2003)"},{"key":"15_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1007\/978-3-642-40450-4_55","volume-title":"Algorithms \u2013 ESA 2013","author":"S Kratsch","year":"2013","unstructured":"Kratsch, S.: On polynomial kernels for integer linear programs: covering, packing and feasibility. In: Bodlaender, H.L., Italiano, G.F. (eds.) ESA 2013. LNCS, vol. 8125, pp. 647\u2013658. Springer, Heidelberg (2013)"},{"issue":"4","key":"15_CR8","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"HW Lenstra Jr","year":"1983","unstructured":"Lenstra Jr., H.W.: Integer programming with a fixed number of variables. Mathematics of Operations Research 8(4), 538\u2013548 (1983)","journal-title":"Mathematics of Operations Research"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Niedermeier, R.: Invitation to fixed-parameter algorithms (2006)","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001"},{"issue":"9","key":"15_CR10","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.: Maximizing the functional yield of wafer-to-wafer 3-d integration. IEEE Transactions on Very Large Scale Integration (VLSI) Systems 17(9), 1357\u20131362 (2009)","journal-title":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Williamson, D.P., Shmoys, D.B.: The design of approximation algorithms. Cambridge University Press (2011)","DOI":"10.1017\/CBO9780511921735"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Zuckerman, D.: Linear degree extractors and the inapproximability of max clique and chromatic number. In: Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing, pp. 681\u2013690. ACM (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_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T00:58:43Z","timestamp":1676941123000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-18173-8_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319181721","9783319181738"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-18173-8_15","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"}}]}}