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-Reference-Cited by-同舟云学术

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

Published:2014-10 Issue:5 Volume:34 Page:597-629
ISSN:0209-9683
Container-title:Combinatorica
language:en
Short-container-title:Combinatorica

Author:

Sebő András,Vygen Jens

Publisher

Springer Science and Business Media LLC

Subject

Computational Mathematics,Discrete Mathematics and Combinatorics

Link

http://link.springer.com/content/pdf/10.1007/s00493-014-2960-3.pdf

Reference33 articles.

1. A. Alexander, S. Boyd, and P. Elliott-Magwood: On the integrality gap of the 2-edge connected subgraph problem, Technical Report TR-2006-04, SITE, University of Ottawa, 2006.

2. H.-C. An, R. Kleinberg, and D. B. Shmoys: Improving Christofides’ algorithm for the s-t path TSP, Proceedings of the 44th Annual ACM Symposium on Theory of Computing (2012), 875–886

3. F. Barahona and M. Conforti: A construction for binary matroids, Discrete Mathematics 66 (1987), 213–218.

4. S. Boyd, R. Sitters, S. van der Ster and L. Stougie: TSP on cubic and subcubic graphs, in: Integer Programming and Combinatorial Optimization; Proceedings of the 15th IPCO Conference; LNCS 6655 (O. Günlük, G.J. Woeginger, eds.), Springer, Berlin 2011, 65–77.

5. R. Carr and R. Ravi: A new bound for the 2-edge connected subgraph problem, in: Integer Programming and Combinatorial Optimization; Proceedings of the 6th IPCO Conference; LNCS 1412 (R.E. Bixby, E.A. Boyd, R.Z. Ríos-Mercado, eds.), Springer, Berlin 1998, 112–125.

Cited by 96 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Circulant TSP special cases: Easily-solvable cases and improved approximations;Operations Research Letters;2024-07

2. Ghost Value Augmentation for k-Edge-Connectivity;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

3. On approximating a new generalization of traveling salesman problem;Heliyon;2024-05

4. A Lower Bound for the Max Entropy Algorithm for TSP;Lecture Notes in Computer Science;2024

5. Algorithms for Future Mobility Society;Advanced Mathematical Science for Mobility Society;2024