Motivated by the yield optimization problem in semiconductor manufacturing, we model the wafer to wafer integration problem as a special multi-dimensional assignment problem (called WWI-m), and study it from an approximation point of view. We give approximation algorithms achieving an approximation factor of 3/2 and 4/3 for WWI-3, and we show that extensions of these algorithms to the case of arbitrary m do not give constant factor approximations. We argue that a special case of the yield optimization problem can be solved in polynomial time. © Springer-Verlag 2013.
CITATION STYLE
Dokka, T., Bougeret, M., Boudet, V., Giroudeau, R., & Spieksma, F. C. R. (2013). Approximation algorithms for the wafer to wafer integration problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7846 LNCS, pp. 286–297). https://doi.org/10.1007/978-3-642-38016-7_23
Mendeley helps you to discover research relevant for your work.