Maximizing a Monotone Submodular Function Subject to a Matroid Constraint

  title={Maximizing a Monotone Submodular Function Subject to a Matroid Constraint},
  author={Gruia Calinescu and Chandra Chekuri and Martin P{\'a}l and Jan Vondr{\'a}k},
  journal={SIAM J. Comput.},
Let f : 2 → R+ be a monotone submodular set function, and let (X, I) be a matroid. We consider the problem maxS∈I f(S). It is known that the greedy algorithm yields a 1/2approximation [17] for this problem. For certain special cases, e.g. max|S|≤k f(S), the greedy algorithm yields a (1− 1/e)-approximation. It is known that this is optimal both in the value oracle model (where the only access to f is through a black box returning f(S) for a given set S) [37], and also for explicitly posed… CONTINUE READING
Highly Influential
This paper has highly influenced 53 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 381 citations. REVIEW CITATIONS

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
236 Extracted Citations
49 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.
Showing 1-10 of 236 extracted citations

382 Citations

Citations per Year
Semantic Scholar estimates that this publication has 382 citations based on the available data.

See our FAQ for additional information.

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 49 references

An analysis of approximations for maximizing submodular set functions - II

  • M. L. Fisher, G. L. Nemhauser, L. A. Wolsey
  • Math. Prog. Study, 8:73–87
  • 1978
Highly Influential
18 Excerpts


  • J. Edmonds
  • submodular functions and certain polyhedra…
  • 1970
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…