(algorithmic technique)
Definition: A set of algorithms {Aε| ε > 0}, where each Aε is a (1+ε)-approximation algorithm and the execution time is bounded by a polynomial in the length of the input. The execution time may depend on the choice of ε. Sometimes referred to more precisely as polynomial-time approximation scheme.
Also known as PTAS.
See also fully polynomial approximation scheme.
Note: From Algorithms and Theory of Computation Handbook, page 34-17, Copyright © 1999 by CRC Press LLC. Appearing in the Dictionary of Computer Science, Engineering and Technology, Copyright © 2000 CRC Press LLC.
Author: CRC-A
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified Fri Dec 17 12:06:36 2004.
HTML page formatted Wed Oct 26 09:47:58 2005.
Cite this as:
Algorithms and Theory of Computation Handbook, CRC Press LLC, 1999, "polynomial approximation scheme", from
Dictionary of Algorithms and Data
Structures, Paul E. Black, ed.,
NIST.
http://www.nist.gov/dads/HTML/polynomaprox.html
