Applied Algorithms in a Nutshell (1)
There are genuinely hard problems that require approximate solutions.
- NP-completeness
- Branch and Bound for small input size
- Local search techniques
- Specialized techniques like GLA.
Some apparently hard problems are not really so.
- minimum spanning tree
- contiguous ordering