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 ...)
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.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 22 January 2013.
HTML page formatted Wed Mar 13 12:42:45 2019.
Cite this as:
Algorithms and Theory of Computation Handbook, CRC Press LLC, 1999, "ρ-approximation algorithm", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 22 January 2013. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/rhoapproxmtn.html