An approximation algorithm with ratio 2 that is used to solve the k-center problem is termed the "parametric" form of  this technique. Chess programs can use a null-move heuristic and the futility version of this technique to reduce the  effective branching factor. In neural networks, two major classes of algorithms named for this technique are sensitivity-  calculation methods and penalty-term methods. Beam search is a typical example of the forward version of this technique.  The best-known algorithm for this technique stores a maximum value for a max node's descendants and a minimum value  for a min node's descendants in its two namesake parameters. That algorithm is usually combined with (*) minimax and is  the alpha-beta type of this t
An approximation algorithm with ratio 2 that is used to solve the k-center problem is termed the "parametric" form of  this technique. Chess programs can use a null-move heuristic and the futility version of this technique to reduce the  effective branching factor. In neural networks, two major classes of algorithms named for this technique are sensitivity-  calculation methods and penalty-term methods. Beam search is a typical example of the forward version of this technique.  The best-known algorithm for this technique stores a maximum value for a max node's descendants and a minimum value  for a min node's descendants in its two namesake parameters. That algorithm is usually combined with (*) minimax and is  the alpha-beta type of this technique. For 10 points, name this technique that removes extraneous parts of decision trees and takes  its name from horticulture.
An approximation algorithm with ratio 2 that is used to solve the k-center problem is termed the "parametric" form of  this technique.