D. Bienstock, E. F. Brickell, C. L. Barahona, and A. R. Mahjoub, On the structure of minimum weight kconnected spanning networks On two-connected subgraph polytopes, SIAM Journal on Discrete Mathematics Discrete Mathematics, vol.3, issue.147, pp.245-25919, 1990.

]. L. Cac89 and . Caccetta, Graph theory in network design and analysis, Recent Studies in Graph Theory, pp.29-63, 1989.

I. [. Caccetta, J. Hartman, and . Huang, Concerning the number of edges in a graph with diameter constraints, Journal of Combinatorial Mathematics and Combinatorial Computing, vol.36, pp.161-173, 2001.

A. [. Coullard, R. L. Rais, D. K. Rardin, and . Wagner, Linear-time algorithms for the 2- connected Steiner subgraph problem on special classes of graphs. Networks, pp.195-206, 1993.

C. [. Christofides and . Whitlock, Network synthesis with connectivity constraints : a survey, Operational Research, pp.705-723, 1981.

C. [. Erikson, A. F. Monma, and J. Veinott, Send-and-Split Method for Minimum-Concave-Cost Network Flows, Mathematics of Operations Research, vol.12, issue.4, pp.634-664, 1987.
DOI : 10.1287/moor.12.4.634

M. L. Elkin and D. Peleg, $(1 + \epsilon,\beta)$-Spanner Constructions for General Graphs, Proceedings of 33 rd Annual ACM Symp. on Theory of Computing, pp.173-182, 2001.
DOI : 10.1137/S0097539701393384

M. [. Fortz, F. Labbé, and . Maffioli, Solving the Two-Connected Network with Bounded Meshes Problem, Operations Research, vol.48, issue.6, pp.866-877, 2000.
DOI : 10.1287/opre.48.6.866.12390
URL : https://hal.archives-ouvertes.fr/hal-01255611

A. [. Farley and . Proskurowski, Minimum Self-Repairing Graphs, Graphs and Combinatorics, vol.7, issue.4, pp.345-351, 1997.
DOI : 10.1007/BF03353012
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.29.8547

M. Grötschel and C. Monma, Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints, SIAM Journal on Discrete Mathematics, vol.3, issue.4, pp.502-523, 1990.
DOI : 10.1137/0403043

M. Grötschel, C. Monma, and M. Stoer, Polyhedral approaches to network survivability, Reliability of Computer and Communication Networks Series in Discrete Mathematics and Computer Science, pp.121-141, 1991.

M. Grötschel, C. Monma, and M. Stoer, Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints, Operations Research, vol.40, issue.2, pp.309-330, 1992.
DOI : 10.1287/opre.40.2.309

M. Grötschel, C. Monma, and M. Stoer, Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints, SIAM Journal on Optimization, vol.2, issue.3, pp.474-504, 1992.
DOI : 10.1137/0802024

]. D. Hsu94 and . Hsu, On container width and length in graphs, groups and networks, IEICE. Trans. Fundam E77, vol.4, pp.668-680, 1994.

C. Monma, B. S. Munson, and W. R. Pulleyblank, Minimum-weight two-connected spanning networks, Mathematical Programming, pp.153-171, 1990.
DOI : 10.1007/BF01585735
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.83.5692

P. [. Steiglitz, D. Weiner, and . Kleitman, The Design of Minimum-Cost Survivable Networks, IEEE Transactions on Circuit Theory, vol.16, issue.4, pp.16455-460, 1969.
DOI : 10.1109/TCT.1969.1083004

]. P. Win85 and . Winter, Generalized Steiner problem in Halin graphs, Proceedings of the 12 th International Symposium on Mathematical Programming. MIT, 1985.

]. P. Win86 and . Winter, Generalized Steiner problem in series-parallel networks, Journal of Algorithms, vol.7, pp.549-566, 1986.