+An **approximation algorithm** is a method designed to find a near-optimal solution to computationally hard problems when an exact solution is infeasible. It trades perfection for efficiency, offering a practical bound on how far its answer deviates from the true optimum, vital in fields like [Optimization](/wiki/optimization) and [Computational Complexity](/wiki/computational_complexity).
+## See also
+- [Algorithm](/wiki/algorithm)
+- [Heuristic](/wiki/heuristic)
+- [NP-hard](/wiki/np-hard)
... 1 more lines