P. Alimonti and V. Kann, Some APX-completeness results for cubic graphs, Theoretical Computer Science, vol.237, issue.1-2, p.123134, 2000.
DOI : 10.1016/S0304-3975(98)00158-3

G. Ausiello and V. T. Paschos, Reductions, completeness and the hardness of approximability, European Journal of Operational Research, vol.172, issue.3, p.719739, 2006.
DOI : 10.1016/j.ejor.2005.06.006

N. Bansal and S. Khot, Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems, International Colloquium on Automata, Languages and Programming (ICALP), p.250261, 2010.
DOI : 10.1007/978-3-642-14165-2_22

T. Dokka, M. Bougeret, V. Boudet, R. Giroudeau, and F. C. Spieksma, Approximation Algorithms for the Wafer to Wafer Integration Problem, Approximation and Online Algorithms (WAOA), p.286297, 2013.
DOI : 10.1007/978-3-642-38016-7_23
URL : https://hal.archives-ouvertes.fr/lirmm-00805063

T. Dokka, Y. Crama, and F. C. Spieksma, Multi-dimensional vector assignment problems, Discrete Optimization, vol.14, p.111125, 2014.
DOI : 10.1016/j.disopt.2014.08.005

G. Duvillié, M. Bougeret, V. Boudet, T. Dokka, and R. Giroudeau, On the Complexity of Wafer-to-Wafer Integration, International Conference on Algorithms and Complexity (CIAC), p.208220, 2015.
DOI : 10.1007/978-3-319-18173-8_15

C. Papadimitriou and M. Yannakakis, Optimization, approximation, and complexity classes, Proceedings of the twentieth annual ACM symposium on Theory of computing, p.229234, 1988.

S. Reda, G. Smith, and L. Smith, Maximizing the functional yield of wafer-towafer 3-d integration, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, p.13571362, 2009.