Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
dsr12
on Nov 10, 2012
|
parent
|
context
|
favorite
| on:
Traveling Salesman: the most misunderstood problem
TL;DR: For now TSP-OPTIMIZE is in NP-Hard but not (necessarily) in NP, so its not in NP-Complete. TSP-DECIDE is both in NP-Hard as well as NP, and is therefore NP-Complete.
Consider applying for YC's Winter 2027 batch!
Applications
are open till November 2.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
