Tag - Approximation Algorithms
Polynomial-time approximation schemes
Wed, May 4, 2016 02:00 CEST
PTAS
\((1\pm\varepsilon)\)-approximation with complexity \(O(n^{f(\varepsilon)})\).
\((1\pm\varepsilon)\)-approximation with complexity \(O(n^{f(\varepsilon)})\).