Complexity indices for the travelling salesman problem and data mining.docVIP

下载本文档

4
0
约1.93万字
约 9页
2017-05-08 发布于上海
举报
版权申诉

Complexity indices for the travelling salesman problem and data mining.doc

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

Complexity indices for the travelling salesman problem and data mining

Transactions on Combinatorics ISSN(print): 2251-8657,ISSN(on-line): 2251-8665 Vol. 01No.1(2012),pp. 35-43. c 2012UniversityofIsfahan binatorics.ir www.ui.ac.ir COMPLEXITY INDICES FOR THE TRAVELLING SALESMAN PROBLEM AND DATA MINING ˇ DRAGOSCVETKOVIC′ CommunicatedbyAlirezaAbdollahi Abstract. We extend our previous work on complexity indices for the travelling salesman problem (TSP)usinggraphspectraltechniquesofdatamining. Acomplexityindexisaninvariantofaninstance 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 algorithmsareusedincludinginformationobtainedfromthespectralgapinLaplacianspectraofshort edgesubgraphs. 1. Introduction Thewell-knowntravellingsalesmanproblem(TSP)consistsin?ndingaHamiltoniancycleofmin- imal weight in a weighted complete graph. Asurvey of research on TSP can be found, for example, inbooks [9],[8]. A complexity index is an invariant of an instance I by which we can predict the execution time ofanexactalgorithmforTSPforI. Complexityindicesareusefulindesigningadaptivealgorithms andincreatingsearchstrategieswithinbranchandboundalgorithms[4]. Althoughthereareinthe literature some empirical and theoretical considerations on complexity indices (see, for example, [4], [1],[10],[12],[13]),agood theoryofsuchphenomenaisstillmissing. Anumberofcomplexityindicesarebasedonspectralgraphtheory. MSC(2010): Primary: 90C27;Secondary: 05C50. Keywords: Combinatorialoptimization,graphspectra, computationalcomplexit