论文信息 - Improved Algorithms for Non-submodular Function Maximization Problem - 字舞流文

Improved Algorithms for Non-submodular Function Maximization Problem

Donglei Du | Zhicheng Liu | Hong Chang | Xiaoyan Zhang | D. Du | Xiaoyan Zhang | Zhicheng Liu | Hong Chang

[1] Weili Wu,et al. A constrained two-stage submodular maximization , 2021, Theor. Comput. Sci..

[2] Suning Gong,et al. A 1/2-approximation algorithm for maximizing a non-monotone weak-submodular function on a bounded integer lattice , 2020, J. Comb. Optim..

[3] Dachuan Xu,et al. Non-submodular maximization on massive data streams , 2019, J. Glob. Optim..

[4] Qizhi Fang,et al. Parametric monotone function maximization with matroid constraints , 2019, Journal of Global Optimization.

[5] Ding-Zhu Du,et al. Maximize a Monotone Function with a Generic Submodularity Ratio , 2019, AAIM.

[6] Atte Moilanen,et al. New performance guarantees for the greedy maximization of submodular set functions , 2015, Optim. Lett..

[7] Jan Vondrák,et al. Optimal approximation for submodular and supermodular optimization with bounded curvature , 2013, SODA.

[8] Andreas Krause,et al. Streaming submodular maximization: massive data summarization on the fly , 2014, KDD.

[9] Andreas S. Schulz,et al. Approximating the least core value and least core of cooperative games with supermodular costs , 2013, Discret. Optim..