Approximation Algorithms
The fact that a problem is NP-complete doesn’t mean that we can’t find an approximate solution efficiently.
Would really like guarantee on performance.
Previous slide
Next slide
Back to first slide
View graphic version