Submodular Functions Maximization Problems
暂无分享,去创建一个
[1] Vasek Chvátal,et al. The tail of the hypergeometric distribution , 1979, Discret. Math..
[2] Hadas Shachnai,et al. Approximations for Monotone and Nonmonotone Submodular Maximization with Knapsack Constraints , 2013, Math. Oper. Res..
[3] Jan Vondrák,et al. Maximizing a Monotone Submodular Function Subject to a Matroid Constraint , 2011, SIAM J. Comput..
[4] Marek Adamczyk. Non-negative submodular stochastic probing via stochastic contention resolution schemes , 2015, ArXiv.
[5] Laurence A. Wolsey,et al. Best Algorithms for Approximating the Maximum of a Submodular Set Function , 1978, Math. Oper. Res..
[6] Shahar Dobzinski,et al. From query complexity to computational complexity , 2012, STOC '12.
[7] U. Feige,et al. Maximizing Non-monotone Submodular Functions , 2011 .
[8] László Lovász,et al. Submodular functions and convexity , 1982, ISMP.
[9] Moran Feldman,et al. Maximizing Symmetric Submodular Functions , 2014, ESA.
[10] M. Skala. Hypergeometric tail inequalities: ending the insanity , 2013, 1311.5939.
[11] Joseph Naor,et al. Submodular Maximization with Cardinality Constraints , 2014, SODA.
[12] Joseph Naor,et al. A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization , 2015, SIAM J. Comput..
[13] Jan Vondrák,et al. Fast algorithms for maximizing submodular functions , 2014, SODA.
[14] Andreas Krause,et al. Lazier Than Lazy Greedy , 2014, AAAI.
[15] Hadas Shachnai,et al. Maximizing submodular set functions subject to multiple linear constraints , 2009, SODA.
[16] Anupam Gupta,et al. A Stochastic Probing Problem with Applications , 2013, IPCO.
[17] Joseph Naor,et al. A Unified Continuous Greedy Algorithm for Submodular Maximization , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[18] Jan Vondrák,et al. Local Distribution and the Symmetry Gap: Approximability of Multiway Partitioning Problems , 2013, SODA.
[19] J. Vondrák,et al. Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes , 2014 .
[20] W. Hoeffding. Probability Inequalities for sums of Bounded Random Variables , 1963 .
[21] Jan Vondrák,et al. Dependent Randomized Rounding via Exchange Properties of Combinatorial Structures , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[22] Jan Vondrák,et al. Submodular maximization by simulated annealing , 2010, SODA '11.
[23] M. L. Fisher,et al. An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..
[24] Niv Buchbinder,et al. Deterministic Algorithms for Submodular Maximization Problems , 2016, SODA.
[25] Vahab S. Mirrokni,et al. Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions , 2008, EC '08.
[26] Roy Schwartz,et al. Comparing Apples and Oranges: Query Tradeoff in Submodular Maximization , 2015, SODA.
[27] Ola Svensson,et al. Online Contention Resolution Schemes , 2015, SODA.
[28] Jan Vondr. Symmetry and Approximability of Submodular Maximization Problems , 2013 .