## AI 生成解读视频

AI抽取解析论文重点内容自动生成视频

AI解析本论文相关学术脉络

# The Travelling Salesman Problem in Bounded Degree Graphs

ACM Transactions on Algorithms (TALG), no. 2 (2012): ArticleNo.18-ArticleNo.18

EI

We show that the travelling salesman problem in bounded-degreegraphs can be solved in time $O\bigl((2-\epsilon)^n\bigr)$, whereε 0 depends only on the degree bound but noton the number of cities, n. The algorithm is a variant ofthe classical dynamic programming solution due to Bellman, and,independently, Held and Karp. In the case of boun...更多

0