In complexity theory the class APX (an abbreviation of "approximable") is the set of NPoptimization problems that allow polynomial-timeapproximation 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.