A Gap-ETH-Tight Approximation Scheme for Euclidean TSP
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS)(2021)
摘要
We revisit the classic task of finding the shortest tour of $n$, points in d-dimensional Euclidean space, for any fixed constant $d\geqslant 2$. We determine the optimal dependence on $\varepsilon$ in the running time of an algorithm that computes a $(1+\varepsilon){-}$ approximate tour, under a plausible assumption, Specifically, we give an algorithm th...
更多查看译文
关键词
Steiner trees,Computer science,Traveling salesman problems,Approximation algorithms,Task analysis
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络