%0 Journal Article
%T A 4/3-approximation for TSP on cubic 3-edge-connected graphs
%A Nishita Aggarwal
%A Naveen Garg
%A Swati Gupta
%J Computer Science
%D 2011
%I arXiv
%X We provide a polynomial time 4/3 approximation algorithm for TSP on metrics arising from the metric completion of cubic 3-edge connected graphs.
%U http://arxiv.org/abs/1101.5586v1