Approximation Algorithms (A Review)

Abstract

Solutions to Problems of mathematics are transformed into Algorithms and how easily, in terms of space and time, the algorithm solves the problem determines the efficiency of the algorithm .Certain problems of mathematics find various types of algorithms for their solution while there are certain categories of problems where in it is difficult to find the algorithm that solves it and sometimes even the algorithm found is very inefficient. This paper reviews a set of algorithms whose solution is not in polynomial time but can be approximated in polynomial time.