Questions about approximation algorithms.
An approximation algorithm for an optimization problem is an algorithm which finds a feasible solution, with a guarantee on how close the objective value of the solution produced by the algorithm is to the optimal value.
A question about the intrinsic difficulty of approximation should be tagged as approximation-hardness.
|
created |
13 years, 3 months ago by Kaveh |
|
viewed |
41 times |
|
editors |
1 |
