Complexity indices for the travelling salesman problem and data mining

We extend our previous work on complexity indices for the travelling salesman problem (tsp) 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 weighted graphs g. 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 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. spectral clustering algorithms are used including information obtained from the spectral gap in laplacian spectra of short edge subgraphs