R. Carr, S. Doddi, G. Konjevod, and M. Marathe, On the redblue set cover problem, Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms Society for Industrial and Applied Mathematics, pp.345-353, 2000.

R. Chinchani, D. Ha, A. Iyer, H. Q. Ngo, and U. Shambhu, On the Hardness of Approximating the Min-Hack Problem, Journal of Combinatorial Optimization, vol.41, issue.3, pp.295-311, 2005.
DOI : 10.1007/s10878-005-1413-8

I. Dinur and S. Shmuel, On the hardness of approximating label-cover, Information Processing Letters, vol.89, issue.5, pp.247-254, 2004.
DOI : 10.1016/j.ipl.2003.11.007

U. Feige, A threshold of ln n for approximating set cover, Journal of the ACM, vol.45, issue.4, pp.634-652, 1998.
DOI : 10.1145/285055.285059

A. G. Gruber, Algorithmic and complexity results for boolean and pseudoboolean functions

R. Karp, Reducibility among combinatorial problems, Complexity of Computer Computations, pp.85-103, 1972.