Next:
Up:
Previous:
Approximation Algorithms
NP-Complete problems require exponential running times to find optimal solutions
If the problem instance is small, then you can wait
If not, a near-optimal solution in polynomial-time may be acceptable
Next:
Up:
Previous: