Submodular set function: Difference between revisions

Revision as of 06:53, 31 March 2012

Revision as of 03:27, 26 April 2012

Line 85:

<ref name="IFF"> S. Iwata, L. Fleischer, and S. Fujishige, A combinatorial strongly polynomial algorithm for minimizing submodular functions,J. ACM,48 (2001),pp. 761–777</ref>

<ref name="Schrijver">[[Alexander Schrijver|A. Schrijver]], A combinatorial algorithm minimizing submodular functions in strongly polynomial time,J. Combin. Theory Ser. B,80 (2000),pp. 346–355.</ref>

<ref name="FMV">[[Uriel Feige|U. Feige]], V. Mirrokni and J. Vondr´ak. Maximizing non-monotone submodular functions, Proc. of 48th FOCS (2007), 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>

}}