An Improved Exact Algorithm for TSP in Graphs of Maximum Degree 4

被引：0
|
作者：
Mingyu Xiao
Hiroshi Nagamochi
机构：
[1] University of Electronic Science and Technology of China,School of Computer Science and Engineering
[2] Kyoto University,Department of Applied Mathematics and Physics, Graduate School of Informatics
来源：
Theory of Computing Systems | 2016年 / 58卷
关键词：
Traveling salesman problem; Exact exponential algorithm; Graph algorithm; Measure-and-conquer;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
The paper presents a 1.692nnO(1)-time polynomial-space algorithm for the traveling salesman problem in an n-vertex edge-weighted graph with maximum degree 4, which improves the previous results of the 1.890nnO(1)-time polynomial-space algorithm by Eppstein and the 1.733nnO(1)-time exponential-space algorithm by Gebauer.
引用
收藏
页码：241 / 272
页数：31
相关论文
共 50 条
  • [1] An Improved Exact Algorithm for TSP in Graphs of Maximum Degree 4
    Xiao, Mingyu
    Nagamochi, Hiroshi
    [J]. THEORY OF COMPUTING SYSTEMS, 2016, 58 (02) : 241 - 272
  • [2] A Polynomial-Space Exact Algorithm for TSP in Degree-6 Graphs
    Yunos, Norhazwani Md
    Shurbevski, Aleksandar
    Nagamochi, Hiroshi
    [J]. DISCRETE AND COMPUTATIONAL GEOMETRY AND GRAPHS, JCDCGG 2015, 2016, 9943 : 228 - 240
  • [3] An exact algorithm for maximum independent set in degree-5 graphs
    Xiao, Mingyu
    Nagamochi, Hiroshi
    [J]. DISCRETE APPLIED MATHEMATICS, 2016, 199 : 137 - 155
  • [4] An improved approximation algorithm for the maximum TSP
    Zhang, Tongquan
    Yin, Ying
    Li, Jianping
    [J]. THEORETICAL COMPUTER SCIENCE, 2010, 411 (26-28) : 2537 - 2541
  • [5] An improved exact algorithm for cubic graph TSP
    Iwama, Kazuo
    Nakashima, Takuya
    [J]. COMPUTING AND COMBINATORICS, PROCEEDINGS, 2007, 4598 : 108 - +
  • [6] An Exact Algorithm for TSP in Degree-3 Graphs Via Circuit Procedure and Amortization on Connectivity Structure
    Mingyu Xiao
    Hiroshi Nagamochi
    [J]. Algorithmica, 2016, 74 : 713 - 741
  • [7] An Exact Algorithm for TSP in Degree-3 Graphs Via Circuit Procedure and Amortization on Connectivity Structure
    Xiao, Mingyu
    Nagamochi, Hiroshi
    [J]. ALGORITHMICA, 2016, 74 (02) : 713 - 741
  • [8] A refined algorithm for maximum independent set in degree-4 graphs
    Mingyu Xiao
    Hiorshi Nagamochi
    [J]. Journal of Combinatorial Optimization, 2017, 34 : 830 - 873
  • [9] A refined algorithm for maximum independent set in degree-4 graphs
    Xiao, Mingyu
    Nagamochi, Hiorshi
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2017, 34 (03) : 830 - 873
  • [10] Cliques in exact distance powers of graphs of given maximum degree
    Foucaud, Florent
    Mishra, Suchismita
    Narayanan, Narayanan
    Naserasr, Reza
    Valicov, Petru
    [J]. PROCEEDINGS OF THE XI LATIN AND AMERICAN ALGORITHMS, GRAPHS AND OPTIMIZATION SYMPOSIUM, 2021, 195 : 427 - 436
12345