An approximation algorithm is an algorithm that finds an approximate solution to a (typically NP-hard) problem. The quality of the algorithm is measured by how close to the actual optimum it performs. For example, it is a constant factor approximation algorithm if it always outputs a solution that is within a constant factor of the optimum. Hardness of approximation is one way to separate NP-hard problems.
Stats
created |
5 years ago |
viewed |
2 times |
editors |
0 |
Top Answerers
more »Recent Hot Answers
Approximating e with 2s and 3sState of the art in the expected length of the Longest Increasing Subsequence of a random permutation
What is the Time Complexity of the Matrix Exponential?
Sparse approximation of the inverse of a sparse matrix
What is the Time Complexity of the Matrix Exponential?
more »
Related Tags
algorithms × 23
graph-theory × 12
co.combinatorics × 8
nt.number-theory × 5
linear-algebra × 4
matrices × 4
computer-science × 3
heuristics × 2
graph-colorings × 2
np × 2
exponential-sums × 2
random-walk × 2
more related tags