[KongchangAI]
Concept多项式时间近似方案 / Polynomial-time approximation scheme

PTAS

An approximation algorithm framework that, for any given ε>0, produces a (1+ε)-approximate solution in polynomial time. The existence of a PTAS means the problem can be approximated arbitrarily close to the optimal solution.

Timeline (last 90 days)

Nov 5

APX-hard problems do not admit a polynomial-time approximation scheme (PTAS) unless P=NP.

Unverified50%

All Facts (1)

Source Articles