We present a technique for approximately maximizing a class of concave
functions whose evaluation is NP complete. We assume that there is a
polynomial-time approximation algorithm for evaluating a function and
use it to design a polynomial-time algorithm for approximating the max
imum of the function. Finding the exact maximum is NP complete. Our te
chnique is based on Megiddo's parametric searching technique.