Submodular set function: Difference between revisions

Revision as of 16:14, 26 February 2023

Revision as of 04:17, 10 March 2023

Line 120:

<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>

<ref name="SF">Z. Svitkina and L. Fleischer, Submodular approximation: Sampling-based algorithms and lower bounds, SIAM Journal on Computing (2011).</ref>

<ref name="JV">J. Vondrák, Optimal approximation for the submodular welfare problem in the value oracle model, Proc. of STOC (2008), pp. 461–471.</ref>

<ref name="KG">A. Krause and C. Guestrin, Beyond Convexity: Submodularity in Machine Learning, Tutorial at ICML-2008</ref>

<ref name="JB">J. Bilmes, Submodularity in Machine Learning Applications, Tutorial at AAAI-2015.</ref>