A 4/3-approximation for TSP on cubic 3-edge-connected graphs

Operations Research Letters, pp. 393-396, 2018.

Cited by: 2|Views11
EI

Abstract:

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.

Code:

Data:

Your rating :
0

 

Tags
Comments