J. Bredin, E. Demaine, M. Hajiaghayi, and D. Rus, Deploying Sensor Networks With Guaranteed Fault Tolerance, IEEE/ACM Transactions on Networking, vol.18, issue.1, pp.216-228, 2010.
DOI : 10.1109/TNET.2009.2024941
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.217.2234

V. Bryant, Metric Spaces: Iteration and Application, 1985.

D. Chen, D. Du, X. Hu, G. Lin, L. Wang et al., Approximations for Steiner trees with minimum number of Steiner points, Theoretical Computer Science, vol.262, issue.1-2, pp.17-33, 2000.
DOI : 10.1016/S0304-3975(00)00182-1

X. Cheng, D. Du, L. Wang, and B. Xu, Relay sensor placement in wireless sensor networks, Wireless Networks, vol.3, issue.8, pp.347-355, 2008.
DOI : 10.1007/s11276-006-0724-8

A. Frank and E. Tardos, An application of submodular flows, Linear Algebra and its Applications, vol.114, issue.115, pp.320-348, 1989.
DOI : 10.1016/0024-3795(89)90469-2
URL : http://doi.org/10.1016/0024-3795(89)90469-2

A. Frank, Connections in Combinatorial Optimization, Discrete Applied Mathematics, vol.160, issue.12, 2011.
DOI : 10.1016/j.dam.2011.09.003

N. Harold and . Gabow, A representation for crossing set families with applications to submodular flow problems, Proc. SODA, pp.202-211, 1993.

K. Hvam, L. Reinhardt, P. Winter, and M. Zachariasen, Bounding component sizes of two-connected Steiner networks, Information Processing Letters, vol.104, issue.5, pp.159-163, 2007.
DOI : 10.1016/j.ipl.2007.06.009

K. Hvam, L. Reinhardt, P. Winter, and M. Zachariasen, Some structural and geometric properties of two-connected Steiner networks, Proc. CATS, pp.85-90, 2007.

L. Kamma and Z. Nutov, Approximating Survivable Networks with Minimum Number of Steiner Points, Proc. WAOA, pp.154-165, 2010.
DOI : 10.1007/978-3-642-18318-8_14

A. Kashyap, Robust design of wireless networks, 2006.

A. Kashyap, S. Khuller, and M. Shayman, Relay Placement for Higher Order Connectivity in Wireless Sensor Networks, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications, pp.1-12, 2006.
DOI : 10.1109/INFOCOM.2006.273
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.94.9255

S. Khuller and B. Raghavachari, Improved approximation algorithms for uniform connectivity problems, Journal of Algorithms, vol.21, pp.433-450, 1996.
DOI : 10.1145/225058.225066
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.22.7740

S. Khuller and U. Vishkin, Biconnectivity approximations and graph carvings, Journal of the ACM, vol.41, issue.2, pp.214-235, 1994.
DOI : 10.1145/174652.174654
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.56.8290

G. Lin and G. Xue, Steiner tree problem with minimum number of Steiner points and bounded edge-length, Information Processing Letters, vol.69, issue.2, pp.53-57, 1999.
DOI : 10.1016/S0020-0190(98)00201-4

E. L. Luebke and J. S. Provan, On the structure and complexity of the 2-connected Steiner network problem in the plane, Operations Research Letters, vol.26, issue.3, pp.111-116, 2000.
DOI : 10.1016/S0167-6377(99)00068-1

H. Martini and K. J. Swanepoel, Low-degree minimal spanning trees in normed spaces, Applied Mathematics Letters, vol.19, issue.2, pp.122-125, 2006.
DOI : 10.1016/j.aml.2005.03.011
URL : http://doi.org/10.1016/j.aml.2005.03.011

I. Ion and A. Z. Zelikovsky, A note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points, Inf. Process. Lett, vol.75, issue.4, pp.165-167, 2000.

Z. Nutov and A. Yaroshevitch, Wireless network design via 3-decompositions, Information Processing Letters, vol.109, issue.19, pp.1136-1140, 2009.
DOI : 10.1016/j.ipl.2009.07.013
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.403.4769

G. Robins and J. S. Salowe, Low-degree minimum spanning trees, Discrete & Computational Geometry, vol.44, issue.2, pp.151-165, 1995.
DOI : 10.1007/BF02570700
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.49.5440

F. Wang, M. T. Thai, and D. Du, On the construction of 2-connected virtual backbone in wireless networks, IEEE Transactions on Wireless Communications, vol.8, issue.3, pp.1230-1237, 2009.
DOI : 10.1109/TWC.2009.051053

R. W. Whitty, Vertex-disjoint paths and edge-disjoint branchings in directed graphs, Journal of Graph Theory, vol.17, issue.3, pp.349-358, 1987.
DOI : 10.1002/jgt.3190110309

P. Winter and M. Zachariasen, Two-connected Steiner networks: structural properties, Operations Research Letters, vol.33, issue.4, pp.395-402, 2005.
DOI : 10.1016/j.orl.2004.07.010
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.3.4817