论文信息 - The Multi-budget Maximum Weighted Coverage Problem - 字舞流文

The Multi-budget Maximum Weighted Coverage Problem

Gianpiero Monaco | Gianlorenzo D'Angelo | Yllka Velaj | Francesco Cellinese

[1] Jan Vondrák,et al. Submodular Maximization over Multiple Matroids via Generalized Exchange Properties , 2009, Math. Oper. Res..

[2] Yuval Filmus,et al. Monotone Submodular Maximization over a Matroid via Non-Oblivious Local Search , 2012, SIAM J. Comput..

[3] Hadas Shachnai,et al. Approximations for Monotone and Nonmonotone Submodular Maximization with Knapsack Constraints , 2013, Math. Oper. Res..

[4] Reuven Cohen,et al. The Generalized Maximum Coverage Problem , 2008, Inf. Process. Lett..

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

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

[7] Maxim Sviridenko,et al. A note on maximizing a submodular set function subject to a knapsack constraint , 2004, Oper. Res. Lett..

[8] Adam Wierman,et al. Distributed Welfare Games , 2013, Oper. Res..

[9] Asaf Levin,et al. Maximum coverage problem with group budget constraints , 2017, J. Comb. Optim..

[10] Gianpiero Monaco,et al. A 6/5-approximation algorithm for the maximum 3-cover problem , 2013, J. Comb. Optim..

[11] Samir Khuller,et al. The Budgeted Maximum Coverage Problem , 1999, Inf. Process. Lett..

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