An approximation guarantee of the greedy descent algorithm for minimizing a supermodular set function Original Research Article

We consider the problem of minimizing a supermodular set function whose special case is the well-known NP-hard p-median problem. The main result of the paper is a tight bound on the approximation ratio of a greedy heuristic (discrete analog of the steepest descent algorithm) for this problem.