A 4/3-approximation for TSP on cubic 3-edge-connected graphs
We provide a polynomial time 4/3 approximation algorithm for TSP on metrics arising from the metric completion of cubic 3-edge connected graphs.
cs.DS↗
arXiv subjects
Publications and source records attributed to Nishita Aggarwal.
We provide a polynomial time 4/3 approximation algorithm for TSP on metrics arising from the metric completion of cubic 3-edge connected graphs.