  J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In Proceedings of the 0000 ACM SIGMOD International Conference on Management of Data, pages 0-00, Dallas, 0000. ACM.  J. Han, M. Kamber, and J. Pei. Data mining: Concepts and techniques. Morgan Kaufmann Publishers, San Francisco, 0rd edition, 0000.MATH  M. Held and R.M. Karp. The traveling-salesman problem and minimum spanning trees. Operations Research, 00:0000-0000, 0000.MathSciNetCrossRefMATH  M. Held and R.M. Karp. The traveling-salesman problem and minimum spanning trees: Part II. Mathematical Programming