B. S. Baker, Approximation algorithms for NP-complete problems on planar graphs, Journal of the ACM, vol.41, issue.1, pp.153-180, 1994.
DOI : 10.1145/174644.174650

N. Bansal and S. Khot, Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems, Proc. 37th ICALP, pp.250-261, 2010.
DOI : 10.1007/978-3-642-14165-2_22

R. Bar-yehuda and S. Even, On approximating a vertex cover for planar graphs, Proceedings of the fourteenth annual ACM symposium on Theory of computing , STOC '82, pp.303-309, 1982.
DOI : 10.1145/800070.802205

C. Bazgan, Approximation schemes and parameterized complexity, 1995.

I. Dinur and S. Safra, On the hardness of approximating vertex cover, Annals of Mathematics, vol.162, issue.1, pp.439-485, 2005.
DOI : 10.4007/annals.2005.162.439

I. Dinur, V. Guruswami, S. Khot, and O. Regev, A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover, SIAM Journal on Computing, vol.34, issue.5, pp.1129-1146, 2005.
DOI : 10.1137/S0097539704443057

U. Feige, Vertex cover is hardest to approximate on regular graphs, 2003.

M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, 1979.

R. Impagliazzo and R. Paturi, On the Complexity of k-SAT, Journal of Computer and System Sciences, vol.62, issue.2, pp.367-375, 2001.
DOI : 10.1006/jcss.2000.1727

R. Impagliazzo, R. Paturi, and F. Zane, Which Problems Have Strongly Exponential Complexity?, Journal of Computer and System Sciences, vol.63, issue.4, pp.512-530, 2001.
DOI : 10.1006/jcss.2001.1774
URL : http://dimacs.rutgers.edu/~dieter/Seminar/Papers/ipz-strongexp.ps

D. Lokshtanov, D. Marx, and S. Saurabh, Lower bounds based on the Exponential Time Hypothesis, Bulletin of the EATCS, vol.105, pp.41-72, 2011.

D. Marx, Parameterized Complexity and Approximation Algorithms, The Computer Journal, vol.51, issue.1, pp.60-78, 2008.
DOI : 10.1093/comjnl/bxm048
URL : http://comjnl.oxfordjournals.org/cgi/reprint/bxm048v1.pdf

C. H. Papadimitriou and M. Yannakakis, Optimization, approximation, and complexity classes, Journal of Computer and System Sciences, vol.43, issue.3, pp.425-440, 1991.
DOI : 10.1016/0022-0000(91)90023-X

P. Poirion, S. Toubaline, C. D. Ambrosio, and L. Liberti, The power edge set problem, Networks, vol.61, issue.2, pp.104-120, 2016.
DOI : 10.1007/978-3-319-26626-8_27

S. Toubaline, C. D-'ambrosio, L. Liberti, P. Poirion, B. Schieber et al., Complexité du problème power edge set, 2016.

W. Yuill, A. Edwards, S. Chowdhury, and S. P. Chowdhury, Optimal PMU placement: A comprehensive literature review, 2011 IEEE Power and Energy Society General Meeting, pp.1-8, 2011.
DOI : 10.1109/PES.2011.6039376