Source: wikibot/approximation-algorithms
= Approximation algorithms
{wiki=Approximation_algorithms}
Approximation algorithms are a type of algorithm used for solving optimization problems, particularly those that are NP-hard or NP-complete. These problems may not be solvable in polynomial time or may not have efficient exact solutions. Therefore, approximation algorithms provide a way to find solutions that are close to the optimal solution within a guaranteed bound or error margin.