图中TSP实例的平均解

IF 0.9 3区数学 Q2 MATHEMATICS

Journal of Graph Theory Pub Date : 2025-02-16 DOI:10.1002/jgt.23232

Stijn Cambie

{"title":"图中TSP实例的平均解","authors":"Stijn Cambie","doi":"10.1002/jgt.23232","DOIUrl":null,"url":null,"abstract":"<div>\n \n We define the average <math>\n <semantics>\n <mrow>\n \n <mrow>\n <mi>k</mi>\n </mrow>\n </mrow>\n </semantics></math>-TSP distance <math>\n <semantics>\n <mrow>\n \n <mrow>\n <msub>\n <mi>μ</mi>\n \n <mrow>\n <mtext>tsp</mtext>\n \n <mo>,</mo>\n \n <mi>k</mi>\n </mrow>\n </msub>\n </mrow>\n </mrow>\n </semantics></math> of a graph <math>\n <semantics>\n <mrow>\n \n <mrow>\n <mi>G</mi>\n </mrow>\n </mrow>\n </semantics></math> as the average length of a shortest closed walk visiting <math>\n <semantics>\n <mrow>\n \n <mrow>\n <mi>k</mi>\n </mrow>\n </mrow>\n </semantics></math> vertices, that is, the expected length of the solution for a random TSP instance with <math>\n <semantics>\n <mrow>\n \n <mrow>\n <mi>k</mi>\n </mrow>\n </mrow>\n </semantics></math> uniformly random chosen vertices. We prove relations with the average <math>\n <semantics>\n <mrow>\n \n <mrow>\n <mi>k</mi>\n </mrow>\n </mrow>\n </semantics></math>-Steiner distance and characterize the cases where equality occurs. We also give sharp bounds for <math>\n <semantics>\n <mrow>\n \n <mrow>\n <msub>\n <mi>μ</mi>\n \n <mrow>\n <mtext>tsp</mtext>\n \n <mo>,</mo>\n \n <mi>k</mi>\n </mrow>\n </msub>\n \n <mrow>\n <mo>(</mo>\n \n <mi>G</mi>\n \n <mo>)</mo>\n </mrow>\n </mrow>\n </mrow>\n </semantics></math> given the order of the graph.\n </div>","PeriodicalId":16014,"journal":{"name":"Journal of Graph Theory","volume":"109 3","pages":"332-338"},"PeriodicalIF":0.9000,"publicationDate":"2025-02-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The Average Solution of a TSP Instance in a Graph\",\"authors\":\"Stijn Cambie\",\"doi\":\"10.1002/jgt.23232\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div>\\n \\n We define the average <math>\\n <semantics>\\n <mrow>\\n \\n <mrow>\\n <mi>k</mi>\\n </mrow>\\n </mrow>\\n </semantics></math>-TSP distance <math>\\n <semantics>\\n <mrow>\\n \\n <mrow>\\n <msub>\\n <mi>μ</mi>\\n \\n <mrow>\\n <mtext>tsp</mtext>\\n \\n <mo>,</mo>\\n \\n <mi>k</mi>\\n </mrow>\\n </msub>\\n </mrow>\\n </mrow>\\n </semantics></math> of a graph <math>\\n <semantics>\\n <mrow>\\n \\n <mrow>\\n <mi>G</mi>\\n </mrow>\\n </mrow>\\n </semantics></math> as the average length of a shortest closed walk visiting <math>\\n <semantics>\\n <mrow>\\n \\n <mrow>\\n <mi>k</mi>\\n </mrow>\\n </mrow>\\n </semantics></math> vertices, that is, the expected length of the solution for a random TSP instance with <math>\\n <semantics>\\n <mrow>\\n \\n <mrow>\\n <mi>k</mi>\\n </mrow>\\n </mrow>\\n </semantics></math> uniformly random chosen vertices. We prove relations with the average <math>\\n <semantics>\\n <mrow>\\n \\n <mrow>\\n <mi>k</mi>\\n </mrow>\\n </mrow>\\n </semantics></math>-Steiner distance and characterize the cases where equality occurs. We also give sharp bounds for <math>\\n <semantics>\\n <mrow>\\n \\n <mrow>\\n <msub>\\n <mi>μ</mi>\\n \\n <mrow>\\n <mtext>tsp</mtext>\\n \\n <mo>,</mo>\\n \\n <mi>k</mi>\\n </mrow>\\n </msub>\\n \\n <mrow>\\n <mo>(</mo>\\n \\n <mi>G</mi>\\n \\n <mo>)</mo>\\n </mrow>\\n </mrow>\\n </mrow>\\n </semantics></math> given the order of the graph.\\n </div>\",\"PeriodicalId\":16014,\"journal\":{\"name\":\"Journal of Graph Theory\",\"volume\":\"109 3\",\"pages\":\"332-338\"},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2025-02-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Graph Theory\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1002/jgt.23232\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Graph Theory","FirstCategoryId":"100","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/jgt.23232","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 0

摘要

我们定义k -TSP平均距离μ tsp，取图G的k为经过k个顶点的最短封闭行走的平均长度，即：具有k个一致随机选择顶点的随机TSP实例的解的期望长度。我们用平均k -Steiner距离证明了这种关系，并描述了等式发生的情况。我们也给出了μ tsp的明确界限，k (G)给出图的阶数。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

The Average Solution of a TSP Instance in a Graph

We define the average $k$ -TSP distance $μ_{tsp, k}$ of a graph $G$ as the average length of a shortest closed walk visiting $k$ vertices, that is, the expected length of the solution for a random TSP instance with $k$ uniformly random chosen vertices. We prove relations with the average $k$ -Steiner distance and characterize the cases where equality occurs. We also give sharp bounds for $μ_{tsp, k} (G)$ given the order of the graph.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Journal of Graph Theory 数学-数学

CiteScore

1.60

自引率

22.20%

发文量

130

审稿时长

6-12 weeks

期刊介绍： The Journal of Graph Theory is devoted to a variety of topics in graph theory, such as structural results about graphs, graph algorithms with theoretical emphasis, and discrete optimization on graphs. The scope of the journal also includes related areas in combinatorics and the interaction of graph theory with other mathematical sciences. A subscription to the Journal of Graph Theory includes a subscription to the Journal of Combinatorial Designs .