(algorithmic technique)
Definition: An algorithm to solve an optimization problem that runs in polynomial time in the length of the input and outputs a solution that is guaranteed to be close to the optimal solution. "Close" has some well-defined sense called the performance guarantee.
See also ρ-approximation algorithm, absolute performance guarantee.
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:02:12 2004.
HTML page formatted Wed Oct 26 09:47:11 2005.
Cite this as:
Algorithms and Theory of Computation Handbook, CRC Press LLC, 1999, "approximation algorithm", from
Dictionary of Algorithms and Data
Structures, Paul E. Black, ed.,
NIST.
http://www.nist.gov/dads/HTML/approximatin.html
