|
|||||
|
|
Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint |
|
| Authors: | Cui Min Xu Dachuan Guo Longkun Wu Dan |
| Affiliation: | 1.Department of Operations Research and Information Engineering, Beijing University of Technology, Beijing, 100124, People’s Republic of China ;2.Shandong Key Laboratory of Computer Networks, School of Computer Science and Technology, Shandong Computer Science Center, Qilu University of Technology (Shandong Academy of Sciences), Jinan, 250353, People’s Republic of China ;3.School of Mathematics and Statistics, Henan University of Science and Technology, Luoyang, 471023, People’s Republic of China ; |
| Abstract: | Journal of Combinatorial Optimization - Emerging applications in machine learning have imposed the problem of monotone non-submodular maximization subject to a cardinality constraint. Meanwhile,... |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |