Revisiting Modified Greedy Algorithm for Monotone Submodular Maximization with a Knapsack Constraint
暂无分享,去创建一个
[1] G. Nemhauser,et al. Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms , 1977 .
[2] Éva Tardos,et al. Maximizing the Spread of Influence through a Social Network , 2015, Theory Comput..
[3] Maxim Sviridenko,et al. A note on maximizing a submodular set function subject to a knapsack constraint , 2004, Oper. Res. Lett..
[4] Andreas Krause,et al. Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies , 2008, J. Mach. Learn. Res..
[5] Laurence A. Wolsey,et al. Best Algorithms for Approximating the Maximum of a Submodular Set Function , 1978, Math. Oper. Res..
[6] Kai Han,et al. Revisiting Modified Greedy Algorithm for Monotone Submodular Maximization with a Knapsack Constraint , 2020, Proc. ACM Meas. Anal. Comput. Syst..
[7] M. L. Fisher,et al. An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..
[8] L. Wolsey. Maximising Real-Valued Submodular Functions: Primal and Dual Heuristics for Location Problems , 1982, Math. Oper. Res..
[9] Samir Khuller,et al. The Budgeted Maximum Coverage Problem , 1999, Inf. Process. Lett..
[10] Ping Zhang,et al. Trajectory-driven Influential Billboard Placement , 2018, KDD.