NIST

ρ-approximation algorithm

(algorithmic technique)

Definition: An approximation algorithm guaranteed to find a solution at most (or at least, as appropriate) ρ times the optimum. The ratio ρ is the performance ratio or relative performance guarantee of the algorithm.

Generalization (I am a kind of ...)
approximation algorithm.

See also Monte Carlo algorithm.

Note: From Algorithms and Theory of Computation Handbook, pages 32-39 and 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


Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 22 January 2013.
HTML page formatted Fri Feb 23 10:06:07 2018.

Cite this as:
Algorithms and Theory of Computation Handbook, CRC Press LLC, 1999, "ρ-approximation algorithm", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 22 January 2013. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/rhoapproxmtn.html