Jupiter

APX

In complexity theory the class APX (an abbreviation of "approximable") is the set of NP optimization problems that allow polynomial-time approximation algorithms with approximation ratio bounded by a constant (or constant-factor approximation algorithms for short). In simple terms, problems in this class have efficient algorithms that can find an answer within some fixed multiplicative factor of the optimal answer. An approximation algorithm is called an f ( n ) {\displaystyle f(n)} -approximation algorithm for input size n {\displaystyle n} if it can be proven that the solution that the algorithm finds is at most a multiplicative factor of f ( n ) {\displaystyle f(n)} times worse than the optimal solution. Here… more »