| An improved approximation algorithm for maximizing a DR-submodular function over a convex set D Du, Z Liu, C Wu, D Xu, Y Zhou arXiv preprint arXiv:2203.14740, 2022 | 16 | 2022 |
| Guarantees for Maximization of k-Submodular Functions with a Knapsack and a Matroid Constraint K Yu, M Li, Y Zhou, Q Liu International Conference on Algorithmic Applications in Management, 156-167, 2022 | 10 | 2022 |
| Approximation algorithms for fuzzy C-means problem based on seeding method Q Liu, J Liu, M Li, Y Zhou Theoretical Computer Science 885, 146-158, 2021 | 10 | 2021 |
| On maximizing monotone or non-monotone k-submodular functions with the intersection of knapsack and matroid constraints K Yu, M Li, Y Zhou, Q Liu Journal of Combinatorial Optimization 45 (3), 93, 2023 | 8 | 2023 |
| Non-monotone k-Submodular Function Maximization with Individual Size Constraints H Xiao, Q Liu, Y Zhou, M Li International Conference on Computational Data and Social Networks, 268-279, 2022 | 8 | 2022 |
| A class of exact penalty functions and penalty algorithms for nonsmooth constrained optimization problems Q Liu, Y Xu, Y Zhou Journal of Global Optimization 76 (4), 745-768, 2020 | 8 | 2020 |
| Spherical 𝑡_ {𝜀}-designs for approximations on the sphere Y Zhou, X Chen Mathematics of Computation 87 (314), 2831-2855, 2018 | 7 | 2018 |
| A Novel Initialization Algorithm for Fuzzy C-means Problem Q Liu, J Liu, M Li, Y Zhou International Conference on Theory and Applications of Models of Computation …, 2020 | 6 | 2020 |
| A smoothing trust region filter algorithm for nonsmooth least squares problems XJ Chen, SQ Du, Y Zhou Science China Mathematics 59, 999-1014, 2016 | 6 | 2016 |
| Approximation Algorithms for k-Submodular Maximization Subject to a Knapsack Constraint H Xiao, Q Liu, Y Zhou, M Li Journal of the Operations Research Society of China, 1-16, 2024 | 5 | 2024 |
| -Submodular Maximization with a Knapsack Constraint and Matroid Constraints Q Liu, K Yu, M Li, Y Zhou Tsinghua Science and Technology 28 (5), 896-905, 2023 | 3 | 2023 |
| Fast algorithms for supermodular and non-supermodular minimization via bi-criteria strategy X Zhang, Q Liu, M Li, Y Zhou Journal of Combinatorial Optimization 44 (5), 3549-3574, 2022 | 3 | 2022 |
| Maximizing modular plus non-monotone submodular functions X Sun, C Wu, D Xu, Y Zhou arXiv preprint arXiv:2203.07711, 2022 | 3 | 2022 |
| Fast algorithms for k-submodular maximization subject to a matroid constraint S Niu, Q Liu, Y Zhou, M Li arXiv preprint arXiv:2307.13996, 2023 | 2 | 2023 |
| A smoothing trust region filter algorithm for nonsmooth nonconvex least squares problems X Chen, S Du, Y Zhou tech. report, SIAM Annual Meeting 2014, Chicago, 2014 | 2 | 2014 |
| Maximizing submodular+ supermodular functions subject to a fairness constraint Z Zhang, K Meng, D Du, Y Zhou Tsinghua Science and Technology 29 (1), 46-55, 2023 | 1 | 2023 |
| Improved Approximation Algorithms for Matroid and Knapsack Means Problems A Zhao, Y Zhou, Q Liu International Journal of Foundations of Computer Science, 1-21, 2023 | 1 | 2023 |
| Streaming algorithms for monotone non-submodular function maximization under a knapsack constraint on the integer lattice J Tan, F Wang, W Ye, X Zhang, Y Zhou Theoretical Computer Science 937, 39-49, 2022 | 1 | 2022 |
| A stochastic non-monotone DR-submodular maximization problem over a convex set Y Lian, D Xu, D Du, Y Zhou International Computing and Combinatorics Conference, 1-11, 2022 | 1 | 2022 |
| Two-stage stochastic max-weight independent set problems M Li, Q Liu, Y Zhou International Conference on Combinatorial Optimization and Applications, 203-213, 2021 | 1 | 2021 |
