(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 E. Black.
Entry modified Fri Feb 4 11:04:13 2005.
HTML page formatted Wed Oct 26 09:48:00 2005.
Cite this as:
Paul E. Black, "prune and search", from
Dictionary of Algorithms and Data
Structures, Paul E. Black, ed.,
NIST.
http://www.nist.gov/dads/HTML/pruneNsearch.html
