Completeness in Approximation Classes

@inproceedings{Crescenzi1989CompletenessIA,
  title={Completeness in Approximation Classes},
  author={Pierluigi Crescenzi and Alessandro Panconesi},
  booktitle={FCT},
  year={1989}
}
We introduce a formal framework for studying approximation properties of NP optimization (NPO) problems. The classes of approximable problems we consider are those appearing in the literature, namely the class of approximable problems within a constant E (APX), and the class of problems having a polynomial time approximation scheme (PTAS). We define natural approximation preserving reductions and obtain completeness results in NPO, APX, and PTAS. A complete problem in a class cannot have… CONTINUE READING
Highly Influential
This paper has highly influenced a number of papers. REVIEW HIGHLY INFLUENTIAL CITATIONS