Yang Zhou 0018

dblp:07/4580-18 · DBLP profile ↗
← Back
19ranked-venue papers
1as first author
16since 2021 · last 2026
0000-0001-5692-6281ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 14 · 1 first-author · 11 since 2021Artificial intelligence and machine learning · 4 · 4 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021
YearPublicationVenuePosition
2026 k-Submodular and approximately non-k-submodular maximization under p-system and ℓ knapsack constraints
Hanlu Ye, Heqing Li, Min Li 0028, Yang Zhou 0018, Qian Liu 0016
Theor. Comput. Sci.4
2024 or-Submodular Maximization Under a Matroid Constraint and a Knapsack Constraint
Qian Liu 0016, Yang Zhou 0018, Min Li 0028
AAIM (1)3
2024 Randomized Mechanisms for Improved Approximation Ratios in Heterogeneous Two-Facility Location
Qian Liu 0016, Min Li 0028, Yang Zhou 0018
COCOA (1)4
2024 Approximately Non-k-submodular Maximization Under p-System and ℓ Knapsack Constraints$^\star $
Hanlu Ye, Heqing Li, Min Li 0028, Yang Zhou 0018, Qian Liu 0016
COCOA (1)4
2024 Stochastic Variance Reduction for DR-Submodular Maximization
Yuefang Lian, Donglei Du, Xiao Wang 0011, Dachuan Xu 0001, Yang Zhou 0018
Algorithmica5
2023 DR-Submodular Function Maximization with Adaptive Stepsize
Min Li 0028, Qian Liu 0016, Yang Zhou 0018
COCOON (1)4
2023 The Regularized Submodular Maximization via the Lyapunov Method
Congying Han, Dachuan Xu 0001, Yang Zhou 0018
COCOON (2)5
2023 Random Approximation Algorithms for Monotone k-Submodular Function Maximization with Size Constraints
Min Li 0028, Yang Zhou 0018, Qian Liu 0016
IJTCS-FAW3
2022 Guarantees for Maximization of k-Submodular Functions with a Knapsack and a Matroid Constraint
Kemin Yu, Min Li 0028, Yang Zhou 0018, Qian Liu 0016
AAIM3
2022 A Stochastic Non-monotone DR-Submodular Maximization Problem over a Convex Set
Yuefang Lian, Dachuan Xu 0001, Donglei Du, Yang Zhou 0018
COCOON4
2022 The submodularity of two-stage stochastic maximum-weight independent set problems
Min Li 0028, Qian Liu 0016, Yang Zhou 0018
Theor. Comput. Sci.4
2022 Streaming algorithms for monotone non-submodular function maximization under a knapsack constraint on the integer lattice
Jingjing Tan, Fengmin Wang, Weina Ye, Yang Zhou 0018
Theor. Comput. Sci.5
2021 Bi-criteria Adaptive Algorithms for Minimizing Supermodular Functions with Cardinality Constraint
Qian Liu 0016, Min Li 0028, Yang Zhou 0018
AAIM4
2021 Two-Stage Stochastic Max-Weight Independent Set Problems
Min Li 0028, Qian Liu 0016, Yang Zhou 0018
COCOA3
2021 Maximization of Monotone Non-submodular Functions with a Knapsack Constraint over the Integer Lattice
Jingjing Tan, Fengmin Wang, Yang Zhou 0018
COCOA4
2021 Approximation algorithms for fuzzy C-means problem based on seeding method
Qian Liu 0016, Min Li 0028, Yang Zhou 0018
Theor. Comput. Sci.4
2020 A Bi-criteria Analysis for Fuzzy C-means Problem
Yang Zhou 0018, Min Li 0028, Qian Liu 0016
AAIM1
2020 A Novel Initialization Algorithm for Fuzzy C-means Problem
Qian Liu 0016, Min Li 0028, Yang Zhou 0018
TAMC4
2020 A class of exact penalty functions and penalty algorithms for nonsmooth constrained optimization problems
Qian Liu 0016, Yuqing Xu, Yang Zhou 0018
J. Glob. Optim.3