New inapproximability bounds for TSP-Reference-Cited by-同舟云学术

New inapproximability bounds for TSP

Author:

Karpinski Marek,Lampis Michael,Schmied Richard

Funder

DFG

Hausdorff

Ministry of Education, Culture, Sports, Science, and Technology

ERC

Hausdorff Doctoral Fellowship

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science

Reference24 articles.

2. AnO(log⁡n/log⁡log⁡n)-approximation algorithm for the asymmetric traveling salesman problem;Asadpour,2010

3. On some tighter inapproximability results (extended abstract);Berman,1999

4. Efficient amplifiers and bounded degree optimization;Berman;Electron. Colloq. Comput. Complex. (ECCC),2001

5. Improved approximation lower bounds on small occurrence optimization;Berman;Electron. Colloq. Comput. Complex. (ECCC),2003

Cited by 53 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

3. An O(1)-rounds Deterministic Distributed Approximation Algorithm for the Traveling Salesman Problem in Congested Clique;2024 20th International Conference on Distributed Computing in Smart Systems and the Internet of Things (DCOSS-IoT);2024-04-29

4. Private measures, random walks, and synthetic data;Probability Theory and Related Fields;2024-04-20