The Euclidean travelling salesman problem is NP-complete-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

The Euclidean travelling salesman problem is NP-complete

Published:1977-06 Issue:3 Volume:4 Page:237-244
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Papadimitriou Christos H.

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference8 articles.

1. Some NP-complete geometric problems;Garey;Proc. 8th ACM Symp. Theory Comput.,1976

2. Some simplified NP-complete problems;Garey;Proc. 6th STOC,1974

3. A dynamic programming approach to sequencing problems;Held;J. SIAM,1962

4. D.S. Johnson, private communication (October 1975).

5. Reducibility among combinatorial problems;Karp,1972

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

1. Euclidean TSP in Narrow Strips;Discrete & Computational Geometry;2024-01-08

2. Lower Bounds of Functions on Finite Abelian Groups;Lecture Notes in Computer Science;2023-12-09

3. Approximating Minimum k-Tree Cover of a Connected Graph Inspired by the Multi-Ferry Routing in Delay Tolerant Networks;International Journal of Foundations of Computer Science;2023-11-16

4. Optimal transport methods for combinatorial optimization over two random point sets;Probability Theory and Related Fields;2023-11-07

5. Learn global and optimize local: A data-driven methodology for last-mile routing;Computers & Operations Research;2023-11

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP