COMPLEXITY INDICES FOR THE TRAVELLING SALESMAN PROBLEM AND DATA MINING

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

CVETKOVIC DRAGOS

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: TRANSACTIONS ON COMBINATORICS Year:2012 | Volume:1 | Issue:1 Page(s): 35-43

Download Full-Text

Persian Verion

View:

1,100

Download:

222

Cites:

Information Journal Paper

Title

COMPLEXITY INDICES FOR THE TRAVELLING SALESMAN PROBLEM AND DATA MINING

Author(s)

CVETKOVIC DRAGOS | Issue Writer Certificate

Keywords

COMBINATORIAL OPTIMIZATIONQ2

GRAPH SPECTRAQ2

COMPUTATIONAL COMPLEXITYQ2

Abstract

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.

Cites

No record.

References

No record.

Cite

APA: Copy

CVETKOVIC, DRAGOS. (2012). COMPLEXITY INDICES FOR THE TRAVELLING SALESMAN PROBLEM AND DATA MINING. TRANSACTIONS ON COMBINATORICS, 1(1), 35-43. SID. https://sid.ir/paper/213761/en

Vancouver: Copy

CVETKOVIC DRAGOS. COMPLEXITY INDICES FOR THE TRAVELLING SALESMAN PROBLEM AND DATA MINING. TRANSACTIONS ON COMBINATORICS[Internet]. 2012;1(1):35-43. Available from: https://sid.ir/paper/213761/en

IEEE: Copy

DRAGOS CVETKOVIC, “COMPLEXITY INDICES FOR THE TRAVELLING SALESMAN PROBLEM AND DATA MINING,” TRANSACTIONS ON COMBINATORICS, vol. 1, no. 1, pp. 35–43, 2012, [Online]. Available: https://sid.ir/paper/213761/en

Related Journal Papers