Approximation Algorithms for Maximum Coverage with Group Budget Constraints. - Longkun Guo; Min Li 028; Dachuan Xu (COCOA (2), 2017)

Inexact feasibility pump for mixed integer nonlinear programming. - Min Li 028; Q. Liu (Inf. Process. Lett., 2017)

On the double Roman domination of graphs. - Jun Yue; Meiqin Wei; Min Li 028; Guodong Liu (Appl. Math. Comput., 2018)

Approximation algorithms for the robust facility leasing problem. - Lu Han; Dachuan Xu; Min Li 028; Dongmei Zhang 002 (Optim. Lett., 2018)

Approximation Algorithm for the Correlation Clustering Problem with Non-uniform Hard Constrained Cluster Sizes. - Sai Ji; Dachuan Xu; Min Li 028; Yishui Wang (AAIM, 2019)

Local Search Approximation Algorithms for the Spherical k-Means Problem. - Dongmei Zhang 002; Yukun Cheng; Min Li 028; Yishui Wang; Dachuan Xu (AAIM, 2019)

The Seeding Algorithm for Functional k-Means Problem. - Min Li 028; Yishui Wang; Dachuan Xu; Dongmei Zhang 002 (COCOON, 2019)

Stochastic Greedy Algorithm Is Still Good: Maximizing Submodular + Supermodular Functions. - Sai Ji; Dachuan Xu; Min Li 028; Yishui Wang; Dongmei Zhang 002 (WCGO, 2019)

A Streaming Algorithm for k-Means with Approximate Coreset. - Min Li 028; Dachuan Xu; Dongmei Zhang 002; Tong Zhang (Asia Pac. J. Oper. Res., 2019)

Approximation algorithm for squared metric two-stage stochastic facility location problem. - Jin Zhang; Min Li 028; Yishui Wang; Chenchen Wu; Dachuan Xu (J. Comb. Optim., 2019)

Efficient approximation algorithms for maximum coverage with group budget constraints. - Longkun Guo; Min Li 028; Dachuan Xu (Theor. Comput. Sci., 2019)

A Bi-criteria Analysis for Fuzzy C-means Problem. - Yang Zhou 018; Jianxin Liu; Min Li 028; Qian Liu 016 (AAIM, 2020)

Nonsubmodular Maximization with Knapsack Constraint via Multilinear Extension. - Jiachen Ju; Min Li 028; Jianxin Liu; Qian Liu 016; Yang Zhou 018 (PAAP, 2020)

A Novel Initialization Algorithm for Fuzzy C-means Problem. - Qian Liu 016; Jianxin Liu; Min Li 028; Yang Zhou 018 (TAMC, 2020)

A Primal-Dual Algorithm for Euclidean k-Means Problem with Penalties. - Chunying Ren; Dachuan Xu; Donglei Du; Min Li 028 (TAMC, 2020)

Approximation Guarantees for Deterministic Maximization of Submodular Function with a Matroid Constraint. - Xin Sun; Dachuan Xu; Longkun Guo; Min Li 028 (TAMC, 2020)

The Parallel Seeding Algorithm for k-Means Problem with Penalties. - Min Li 028; Dachuan Xu; Jun Yue; Dongmei Zhang 002 (Asia Pac. J. Oper. Res., 2020)

The seeding algorithm for k-means problem with penalties. - Min Li 028; Dachuan Xu; Jun Yue; Dongmei Zhang 002; Peng Zhang 008 (J. Comb. Optim., 2020)

The seeding algorithms for spherical k-means clustering. - Min Li 028; Dachuan Xu; Dongmei Zhang 002; Juan Zou (J. Glob. Optim., 2020)

Bi-criteria Adaptive Algorithms for Minimizing Supermodular Functions with Cardinality Constraint. - Xiaojuan Zhang; Qian Liu 016; Min Li 028; Yang Zhou 018 (AAIM, 2021)

Approximation Algorithm for Min-Max Correlation Clustering Problem with Outliers. - Sai Ji; Min Li 028; Mei Liang; Zhenning Zhang (COCOA, 2021)

Two-Stage Stochastic Max-Weight Independent Set Problems. - Min Li 028; Qian Liu 016; Yang Zhou 018 (COCOA, 2021)

Preface. - Xingju Cai; Min Li 028; Guanghui Wang; Dachuan Xu (Asia Pac. J. Oper. Res., 2021)

Approximation algorithms for fuzzy C-means problem based on seeding method. - Qian Liu 016; Jianxin Liu; Min Li 028; Yang Zhou 018 (Theor. Comput. Sci., 2021)

Deterministic approximation algorithm for submodular maximization subject to a matroid constraint. - Xin Sun; Dachuan Xu; Longkun Guo; Min Li 028 (Theor. Comput. Sci., 2021)

Approximation algorithms for spherical k-means problem using local search scheme. - Dongmei Zhang 002; Yukun Cheng; Min Li 028; Yishui Wang; Dachuan Xu (Theor. Comput. Sci., 2021)

Guarantees for Maximization of k-Submodular Functions with a Knapsack and a Matroid Constraint. - Kemin Yu; Min Li 028; Yang Zhou 018; Qian Liu 016 (AAIM, 2022)

Non-monotone k-Submodular Function Maximization with Individual Size Constraints. - Hao Xiao; Qian Liu 016; Yang Zhou 018; Min Li 028 (CSoNet, 2022)

The provably good parallel seeding algorithms for the k-means problem with penalties. - Min Li 028; Dachuan Xu; Dongmei Zhang 002; Huiling Zhou (Int. Trans. Oper. Res., 2022)

The seeding algorithm for spherical k-means clustering with penalties. - Sai Ji; Dachuan Xu; Longkun Guo; Min Li 028; Dongmei Zhang 002 (J. Comb. Optim., 2022)

Approximation algorithms for two variants of correlation clustering problem. - Sai Ji; Dachuan Xu; Min Li 028; Yishui Wang (J. Comb. Optim., 2022)

The bi-criteria seeding algorithms for two variants of k-means problem. - Min Li 028 (J. Comb. Optim., 2022)

Fast algorithms for supermodular and non-supermodular minimization via bi-criteria strategy. - Xiaojuan Zhang; Qian Liu 016; Min Li 028; Yang Zhou 018 (J. Comb. Optim., 2022)

An improved primal-dual approximation algorithm for the k-means problem with penalties. - Chunying Ren; Dachuan Xu; Donglei Du; Min Li 028 (Math. Struct. Comput. Sci., 2022)

The submodularity of two-stage stochastic maximum-weight independent set problems. - Min Li 028; Hao Xiao; Qian Liu 016; Yang Zhou 018 (Theor. Comput. Sci., 2022)

DR-Submodular Function Maximization with Adaptive Stepsize. - Yanfei Li; Min Li 028; Qian Liu 016; Yang Zhou 018 (COCOON (1), 2023)

Random Approximation Algorithms for Monotone k-Submodular Function Maximization with Size Constraints. - YuYing Li; Min Li 028; Yang Zhou 018; Qian Liu 016 (IJTCS-FAW, 2023)

Stochastic greedy algorithms for maximizing constrained submodular + supermodular functions. - Sai Ji; Dachuan Xu; Min Li 028; Yishui Wang; Dongmei Zhang 002 (Concurr. Comput. Pract. Exp., 2023)

Approximation Algorithms for Matroid and Knapsack Means Problems. - Ao Zhao; Qian Liu 016; Yang Zhou 018; Min Li 028 (Asia Pac. J. Oper. Res., 2023)

On maximizing monotone or non-monotone k-submodular functions with the intersection of knapsack and matroid constraints. - Kemin Yu; Min Li 028; Yang Zhou 018; Qian Liu 016 (J. Comb. Optim., 2023)

or-Submodular Maximization Under a Matroid Constraint and a Knapsack Constraint. - Haifeng Huang; Qian Liu 016; Yang Zhou 018; Min Li 028 (AAIM (1), 2024)

Differentially private k-center problems. - Fan Yuan; Dachuan Xu; Donglei Du; Min Li 028 (Optim. Lett., 2024)

Maximizing a $ k $-submodular function with $ p $-system constraints. - Hanlu Ye; Min Li 028; Yang Zhou 018; Qian Liu 016 (Math. Found. Comput., 2025)

Fast algorithms combining threshold-decreasing and greedy methods for maximizing constraint k-submodular functions. - Shuxian Niu; Qian Liu 016; Yang Zhou 018; Min Li 028 (Discret. Math. Algorithms Appl., 2025)

Randomized approximation algorithms for monotone k-submodular function maximization with constraints. - Yuying Li; Min Li 028; Yang Zhou 018; Shuxian Niu; Qian Liu 016 (J. Comb. Optim., 2025)