we have two important computationally-defined approximation classes:the class NPO(that is, the class of optimization problems whose underlying decision problem is in NP), and the the class APX(that is, the class of constant factor approximable NPO problems)
深蓝
----
shenlan211314@gmail.com