暂无分享,去创建一个
[1] J. Vondrák,et al. Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes , 2014 .
[2] Jan Vondrák,et al. Maximizing a Monotone Submodular Function Subject to a Matroid Constraint , 2011, SIAM J. Comput..
[3] Michael I. Jordan,et al. Advances in Neural Information Processing Systems 30 , 1995 .
[4] Yuichi Yoshida,et al. A Generalization of Submodular Cover via the Diminishing Return Property on the Integer Lattice , 2015, NIPS.
[5] Alexander Schrijver,et al. A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time , 2000, J. Comb. Theory B.
[6] Noga Alon,et al. Optimizing budget allocation among channels and influencers , 2012, WWW.
[7] Chandra Chekuri,et al. Submodular function maximization via the multilinear relaxation and contention resolution schemes , 2011, STOC '11.
[8] Satoru Iwata,et al. A combinatorial strongly polynomial algorithm for minimizing submodular functions , 2001, JACM.
[9] Michael J. Todd,et al. Mathematical programming , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..
[10] Jan Vondrák,et al. Submodular maximization by simulated annealing , 2010, SODA '11.
[11] Maxim Sviridenko,et al. Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee , 2004, J. Comb. Optim..
[12] Jan Vondrák,et al. Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature , 2017, Math. Oper. Res..
[13] Andreas S. Schulz,et al. An FPTAS for optimizing a class of low-rank functions over a polytope , 2013, Math. Program..
[14] Jan Vondrák,et al. Optimal approximation for submodular and supermodular optimization with bounded curvature , 2013, SODA.
[15] Yuichi Yoshida,et al. Maximizing monotone submodular functions over the integer lattice , 2015, IPCO.
[16] Robert M Thrall,et al. Mathematics of Operations Research. , 1978 .
[17] Joseph Naor,et al. Submodular Maximization with Cardinality Constraints , 2014, SODA.
[18] Jérôme Kunegis,et al. KONECT: the Koblenz network collection , 2013, WWW.
[19] Vahab S. Mirrokni,et al. Optimal marketing strategies over social networks , 2008, WWW.
[20] Steffen Staab,et al. Proceedings of the 21st International Conference on World Wide Web , 2012, WWW 2012.
[21] M. L. Fisher,et al. An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..
[22] Victor P. Il'ev,et al. An Approximation Guarantee of the Greedy Descent Algorithm for Minimizing a Supermodular Set Function , 2001, Discret. Appl. Math..
[23] Yunhao Liu,et al. Proceedings of the 17th international conference on World Wide Web , 2008, WWW 2008.
[24] Joseph Naor,et al. A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.
[25] Evdokia Nikolova,et al. On the Hardness and Smoothed Complexity of Quasi-Concave Minimization , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[26] U. Feige,et al. Maximizing Non-monotone Submodular Functions , 2011 .
[27] Ken-ichi Kawarabayashi,et al. Optimal Budget Allocation: Theoretical Guarantee and Efficient Algorithm , 2014, ICML.
[28] Hadas Shachnai,et al. Approximations for Monotone and Nonmonotone Submodular Maximization with Knapsack Constraints , 2013, Math. Oper. Res..
[29] Huy L. Nguyen,et al. A Reduction for Optimizing Lattice Submodular Functions with Diminishing Returns , 2016, ArXiv.
[30] Vahab S. Mirrokni,et al. Maximizing Non-Monotone Submodular Functions , 2011, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[31] Vahab S. Mirrokni,et al. Non-monotone submodular maximization under matroid and knapsack constraints , 2009, STOC '09.