1. Bar-Yehuda, R., Even, S.: A local-ratio theorem for approximating the weighted vertex cover problem. Annals of Discrete Mathematics 25, 27–46 (1985)
2. Berman, P., Karpinski, M.: Improved approximation lower bounds on small occurence optimization, ECCC Report TR03-08 (2003)
3. Lecture Notes in Computer Science;J. Chen,2000
4. Chlebík, M., Chlebíková, J.: Inapproximability results for bounded variants of optimization problems. In: Lingas, A., Nilsson, B.J. (eds.) FCT 2003. LNCS, vol. 2751, pp. 27–38. Springer, Heidelberg (2003) also ECCC Report TR03-26 (2003)
5. Dinur, I., Safra, S.: The importance of being biased. In: STOC 2002, pp. 33–42 (2002) also ECCC Report TR01-104, 2001