A 4/3-approximation for TSP on cubic 3-edge-connected graphs
arXiv:1101.5586
Abstract
We provide a polynomial time 4/3 approximation algorithm for TSP on metrics arising from the metric completion of cubic 3-edge connected graphs.
arXiv:1101.5586
We provide a polynomial time 4/3 approximation algorithm for TSP on metrics arising from the metric completion of cubic 3-edge connected graphs.