“For most NP-complete problems, there exist polynomial-time approximation algorithms that can solve almost all instances in a feasible amount of time.”