S. Boyd and R. Carr, Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices, Discrete Optimization, vol.8, issue.4, pp.525-539, 2011.

S. Boyd, Y. Fu, and Y. Sun, A 5/4-approximation for subcubic 2EC using circulations and obliged edges, Discrete Applied Mathematics, vol.209, pp.48-58, 2016.

S. Boyd, S. Iwata, and K. Takazawa, Finding 2-factors closer to TSP tours in cubic graphs, SIAM Journal on Discrete Mathematics, vol.27, issue.2, pp.918-939, 2013.

S. Boyd and P. Legault, Toward a 6/5 bound for the minimum cost 2-edge connected spanning subgraph, SIAM Journal on Discrete Mathematics, vol.31, issue.1, pp.632-644, 2017.

S. Boyd and A. Seb?, The salesman's improved tours for fundamental classes, Proceedings of 19th International Conference on Integer Programming and Combinatorial Optimization, pp.111-122, 2017.

S. Boyd, R. Sitters, S. Van-der, L. Ster, and . Stougie, The traveling salesman problem on cubic and subcubic graphs, Mathematical Programming, vol.144, issue.1-2, pp.227-245, 2014.

N. Christofides, Worst-case analysis of a new heuristic for the travelling salesman problem, Graduate School of Industrial Administration, 1976.

J. Cheriyan, T. Jordán, and R. Ravi, On 2-coverings and 2-packings of laminar families, European Symposium on Algorithms, pp.510-520, 1999.

J. Cheriyan, H. Karloff, R. Khandekar, and J. Könemann, On the integrality ratio for tree augmentation, Operations Research Letters, vol.36, issue.4, pp.399-401, 2008.

R. Carr and R. Ravi, A new bound for the 2-edge connected subgraph problem, Proceedings of 6th International Conference on Integer Programming and Combinatorial Optimization, pp.112-125, 1998.

R. Carr and S. Vempala, On the Held-Karp relaxation for the asymmetric and symmetric traveling salesman problems, Mathematical Programming, vol.100, issue.3, pp.569-587, 2004.

J. Edmonds and E. L. Johnson, Matching, Euler tours and the Chinese postman, Mathematical Programming, vol.5, issue.1, pp.88-124, 1973.

G. N. Frederickson, J. Ja, and &. Ja, Approximation algorithms for several graph augmentation problems, SIAM Journal on Computing, vol.10, issue.2, pp.270-283, 1981.

G. N. Frederickson, J. Ja, and &. Ja, On the relationship between the biconnectivity augmentation and traveling salesman problems, Theoretical Computer Science, vol.19, issue.2, pp.189-201, 1982.

A. Frank, Augmenting graphs to meet edge-connectivity requirements, SIAM Journal on Discrete Mathematics, vol.5, issue.1, pp.25-53, 1992.

X. Michel, D. J. Goemans, and . Bertsimas, Survivable networks, linear programming relaxations and the parsimonious property, Mathematical Programming, vol.60, issue.1, pp.145-166, 1993.

M. Grötschel, L. Lovász, and A. Schrijver, Geometric Algorithms and Combinatorial Optimization, 1988.

M. X. Goemans, Worst-case comparison of valid inequalities for the TSP, Mathematical Programming, vol.69, issue.1, pp.335-349, 1995.

J. Iglesias and R. Ravi, Coloring down: 3/2-approximation for special cases of the weighted tree augmentation problem, 2017.

K. Jain, A factor 2 approximation algorithm for the generalized Steiner network problem, Combinatorica, vol.21, issue.1, pp.39-60, 2001.

T. Kaiser and R. , Cycles intersecting edge-cuts of prescribed sizes, SIAM Journal on Discrete Mathematics, vol.22, issue.3, pp.861-874, 2008.
URL : https://hal.archives-ouvertes.fr/hal-01184454

P. Legault, Towards New Bounds for the 2-Edge Connected Spanning Subgraph Problem. Master's thesis, 2017.

C. L. Monma, B. Spellman-munson, and W. R. Pulleyblank, Minimumweight two-connected spanning networks, Mathematical Programming, vol.46, issue.1, pp.153-171, 1990.

T. Mömke and O. Svensson, Removing and adding edges for the traveling salesman problem, Journal of the ACM, vol.63, issue.1, 2016.

M. Mucha, 13/9-approximation for graphic TSP. Theory of Computing Systems, vol.55, pp.640-657, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00678172

A. Shayan-oveis-gharan, M. Saberi, and . Singh, A randomized rounding approach to the traveling salesman problem, Proceedings of the 52nd Annual Symposium on Foundations of Computer Science, pp.550-559, 2011.

A. Seb?, Y. Benchetrit, and M. Stehlik, Problems about uniform covers, with tours and detours, Mathematisches Forschungsinstitut Oberwolfach Report, vol.51, pp.2912-2915, 2014.

A. Schrijver, Combinatorial Optimization: Polyhedra and Efficiency

. Springer, , 2003.

A. Seb? and J. Vygen, Shorter tours by nicer ears: 7/5-approximation for the graph-TSP, 3/2 for the path version, and 4/3 for two-edge-connected subgraphs, Combinatorica, vol.34, issue.5, pp.597-629, 2014.

B. David, D. P. Shmoys, and . Williamson, Analyzing the Held-Karp TSP bound: A monotonicity property with application, Information Processing Letters, vol.35, issue.6, pp.281-285, 1990.

L. A. Wolsey, Heuristic analysis, linear programming and branch and bound, Combinatorial Optimization II, pp.121-134, 1980.