A 4/3-approximation for TSP on cubic 3-edge-connected graphs
Operations Research Letters, pp. 393-396, 2018.
For a 3-edge-connected cubic graph G=(V,E), we give an algorithm to construct a connected Eulerian subgraph of 2G using at most ⌊4|V|∕3⌋ edges.
PPT (Upload PPT)