S. Arora and S. Safra, Probabilistic checking of proofs: a new characterization of NP, Journal of the ACM, vol.45, issue.1, pp.70-122, 1998.
DOI : 10.1145/273865.273901

P. Berman, M. Karpinski, and A. Scott, Approximation hardness of short symmetric instances of MAX-3SAT, Electronic Colloquium on Computational Complexity, 2003.

T. Chakraborty, J. Chuzhoy, and S. Khanna, Network design for vertex connectivity, Proceedings of the fourtieth annual ACM symposium on Theory of computing, STOC 08, pp.167-176, 2008.
DOI : 10.1145/1374376.1374403

M. Charikar, C. Chekuri, T. Cheung, Z. Dai, A. Goel et al., Approximation Algorithms for Directed Steiner Problems, Journal of Algorithms, vol.33, issue.1, pp.73-91, 1999.
DOI : 10.1006/jagm.1999.1042

Y. Dodis and S. Khanna, Designing networks with bounded pairwise distance, STOC, pp.750-759, 1999.

J. Feldman and M. , The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals, SIAM Journal on Computing, vol.36, issue.2, pp.543-561, 2006.
DOI : 10.1137/S0097539704441241

J. Guo, R. Niedermeier, and O. Suchy, Parameterized Complexity of Arc-Weighted Directed Steiner Problems, SIAM Journal on Discrete Mathematics, vol.25, issue.2, pp.583-599, 2011.
DOI : 10.1137/100794560

E. Halperin and R. Krauthgamer, Polylogarithmic inapproximability, Proceedings of the thirty-fifth ACM symposium on Theory of computing , STOC '03, pp.585-594, 2003.
DOI : 10.1145/780542.780628

K. Jain, A factor 2 approximation algorithm for the generalized Steiner network problem, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280), pp.39-60, 2001.
DOI : 10.1109/SFCS.1998.743495

S. Khanna and . Talk-on, Vertex-connectivity survivable network design " , Workshop on Approximation Algorithms: The Last Decade and the Next, 2011.

Y. Lando and Z. Nutov, Inapproximability of survivable networks, Theoretical Computer Science, vol.410, issue.21-23, pp.2122-2125, 2009.
DOI : 10.1016/j.tcs.2009.01.036

Z. Nutov, A note on Rooted Survivable Networks, Information Processing Letters, vol.109, issue.19, pp.1114-1119, 2009.
DOI : 10.1016/j.ipl.2009.07.011

H. Prömel and A. Steger, The Steiner tree problem: a tour through graphs, algorithms , and complexity, 2002.
DOI : 10.1007/978-3-322-80291-0

R. Raz, A Parallel Repetition Theorem, SIAM Journal on Computing, vol.27, issue.3, pp.763-803, 1998.
DOI : 10.1137/S0097539795280895

V. Vazirani, Approximation Algorithms, 2001.
DOI : 10.1007/978-3-662-04565-7

D. Williamson and D. Shmoys, The Design of Approximation Algorithms, 2010.
DOI : 10.1017/CBO9780511921735