Highly Influenced

# On the Efficiency of Polynomial Time Approximation Schemes

@article{Cesati1997OnTE, title={On the Efficiency of Polynomial Time Approximation Schemes}, author={Marco Cesati and Luca Trevisan}, journal={Inf. Process. Lett.}, year={1997}, volume={64}, pages={165-171} }

- Published 1997 in Electronic Colloquium on Computational Complexity
DOI:10.1016/S0020-0190(97)00164-6

A polynomial time approximation scheme (PTAS) for an optimization problem A is an algorithm that on input an instance of A and > 0 nds a (1 +)-approximate solution in time that is polynomial for each xed. Typical running times are n O(1==) or 2 1== O(1) n. While algorithms of the former kind tend to be impractical, the latter ones are more interesting. In several cases, the development of algorithms of the second type required considerably new (and sometimes harder) techniques. For someâ€¦Â CONTINUE READING