论文信息 - Multiobjective Maximization of Monotone Submodular Functions with Cardinality Constraint - 字舞流文

Multiobjective Maximization of Monotone Submodular Functions with Cardinality Constraint

We consider the problem of multiobjective maximization of monotone submodular functions subject to cardinality constraint, often formulated as max|A|=k mini∈{1,…,m} fi(A). Although it is widely kno...

[1] Jan Vondrák,et al. Maximizing a Monotone Submodular Function Subject to a Matroid Constraint , 2011, SIAM J. Comput..

[2] Jan Vondrák. Symmetry and Approximability of Submodular Maximization Problems , 2013, SIAM J. Comput..

[3] Leonid Khachiyan,et al. Fast Approximation Schemes for Convex Programs with Many Blocks and Coupling Constraints , 1994, SIAM J. Optim..

[4] Sanjeev Arora,et al. The Multiplicative Weights Update Method: a Meta-Algorithm and Applications , 2012, Theory Comput..

[5] Lisa Fleischer,et al. Approximating Fractional Multicommodity Flow Independent of the Number of Commodities , 2000, SIAM J. Discret. Math..

[6] James B. Orlin,et al. Robust monotone submodular function maximization , 2018, Math. Program..

[7] Andreas Krause,et al. Efficient Sensor Placement Optimization for Securing Large Water Distribution Networks , 2008 .

[8] J. Vondrák,et al. Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes , 2014 .

[9] Avi Ostfeld,et al. The Battle of the Water Sensor Networks (BWSN): A Design Challenge for Engineers and Algorithms , 2008 .

[10] M. L. Fisher,et al. An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..