Hacker News Reader

This is false. There are NP-complete problems that, assuming P!=NP, there are provably no fast and good heuristics for these problems.

Really? Could I see some examples? Most results I've seen are on fixed approximation algorithms not on heuristics.