An approximation algorithm for maximizing a non-decreasing submodular set function and its performance guarantee

Maximizing or minimizing a submodular set function has a wide use in combinatorial optimization problem,and non-increasing or non-decreasing of these set function are very helpful in analyzing these problems.In this paper,we present an approximation algorithm for maximizing a non-increasing submodular set function,and discuss its performance guarantee.