Submodular set function: Difference between revisions

Revision as of 17:21, 16 November 2012

Revision as of 17:22, 16 November 2012

Line 69:

<ref name="FMV">[[Uriel Feige|U. Feige]], V. Mirrokni and J. Vondr&aacute;k, Maximizing non-monotone submodular functions, Proc. of 48th FOCS (2007), pp. 461–471.</ref>

<ref name="NVF"> [[George Nemhauser|G. L. Nemhauser]], L. A. Wolsey and M. L. Fisher, An analysis of approximations for maximizing submodular set functions I, Mathematical Programming 14 (1978), 265–294.</ref>

<ref name="CCPV"> G. Calinescu, C. Chekuri, M. P\&aacute;l and J. VondraVondr&aacute;k, Maximizing a submodular set function subject to a matroid constraint, SIAM J. Comp. 40:6 (2011), 1740-1766.</ref>

<ref name="BFNS"> N. Buchbinder, M. Feldman, J. Naor and R. Schwartz, A tight linear time (1/2)-approximation for unconstrained submodular maximization, Proc. of 53rd FOCS (2012), pp. 649-658.</ref>

<ref name="FW"> Y. Filmus, J. Ward, A tight combinatorial algorithm for submodular maximization subject to a matroid constraint, Proc. of 53rd FOCS (2012), pp. 659-668.</ref>