, 0000.  D.S. Johnson. Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences, 0:000-000, 0000.MathSciNetCrossRef00000-0)MATH  J.B. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society, 