Complexity indices for the travelling salesman problem and data mining

 we extend our previous work on complexity indices for the travelling salesman problem (TSP), summarized in cite{CvCK۳}, using graph spectral techniques of data mining. A complexity index is an invariant of an instance I by which we can predict the execution time of an exact algorithm for TSP for I. We consider the symmetric travelling salesman problem with instances I represented by complete graphs G with distances between vertices (cities) as edge weights (lengths). Intuitively, the hardness of an instance G depends on the distribution of short edges within G. Therefore we consider some short edge subgraphs of G (minimal spanning tree, critical connected subgraph, and several others) as non-weighted graphs and several their invariants as potential complexity indices. Here spectral invariants (e.g. spectral radius of the adjacency matrix) play an important role since, in general, there are intimate relations between eigenvalues and the structure of a graph. Since hidden details of short edge subgraphs really determine the hardness of the instance, we use techniques of data mining to find them. In particular, spectral clustering algorithms are used including information obtained from the spectral gap in Laplacian spectra of short edge subgraphs.

Keywords:

Travelling Salesman Problem , Spectral clustering algorithms , Hamiltonian cycle