An analysis of approximations for maximizing submodular set functions - I


Let N be a finite set and z be a real-valued function defined on the set of subsets of N that satisfies z(S)+z(T)>-z(SUT)+z(SnT) for all S, T in N. Such a function is called submodular. We consider the problem maXscN {z(S): IS[ <-K, z(S) submodular}. Several hard combinatorial optimization problems can be posed in this framework. For example, the problem of… (More)
DOI: 10.1007/BF01588971


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.


Citations per Year

2,156 Citations

Semantic Scholar estimates that this publication has 2,156 citations based on the available data.

See our FAQ for additional information.

Slides referencing similar topics