(algorithmic technique)
Definition: Find an optimal value by eliminating a constant fraction of remaining objects at each step. Eliminated objects are guaranteed not to affect the optimal value. A logarithmic number of steps reduces the number of objects to a constant, and a brute force approach can then solve it.
Also known as decimation.
Note: Adapted from [AS98, page 422].
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 4 February 2005.
HTML page formatted Wed Mar 13 12:42:46 2019.
Cite this as:
Paul E. Black, "prune and search", in
Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 4 February 2005. (accessed TODAY)
Available from: https://www.nist.gov/dads/HTML/pruneNsearch.html