default search action
Min Li 0028
Person information
- affiliation: Shandong Normal University, School of Mathematics and Statistics, Jinan, China
Other persons with the same name
- Min Li — disambiguation page
- Min Li 0001 (aka: Min (Leon) Li) — IMEC, Heverlee, Belgium
- Min Li 0002 — George Mason University, Department of Geography and Geoinformation Science, Fairfax, VA, USA (and 1 more)
- Min Li 0003
— Xi'an Jiaotong University, School of Mechanical Engineering, China (and 2 more)
- Min Li 0004
- Min Li 0005
- Min Li 0006 — Beijing Institute of Technology, Institute of Application Specific Instruction-Set Processors, China
- Min Li 0007
- Min Li 0008
- Min Li 0009
- Min Li 0010
- Min Li 0011
- Min Li 0012 — University of Florida, Scalable Software Systems Laboratory, Gainesville, FL, USA
- Min Li 0013 — Virginia Tech, Blacksburg, VA, USA
- Min Li 0014 — University of California, San Diego, USA
- Min Li 0015 — Chinese University of Hong Kong, Department of Mechanical and Automation Engineering, Hong Kong
- Min Li 0016
- Min Li 0017
- Min Li 0018 — Sanya Aviation and Tourism College, Sanya, China
- Min Li 0019
- Min Li 0020
- Min Li 0021
- Min Li 0022 — Alibaba Group (and 2 more)
- Min Li 0023 — University of Electronic Science and Technology of China (UESTC), School of Automation Engineering, Chengdu, China
- Min Li 0024
- Min Li 0025
- Min Li 0026 — University of Electronic Science and Technology of China, Institute of Fundamental and Frontier Sciences, Chengdu, China
- Min Li 0027
- Min Li 0029
- Min Li 0030 — Xi'an Research Institute of High Technology, China (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j24]Fan Yuan, Dachuan Xu, Donglei Du, Min Li
Differentially private k-center problems. Optim. Lett. 18(8): 1791-1809 (2024) - 2023
- [j23]Ao Zhao, Qian Liu, Yang Zhou
Approximation Algorithms for Matroid and Knapsack Means Problems. Asia Pac. J. Oper. Res. 40(1): 2240007:1-2240007:16 (2023) - [j22]Sai Ji, Dachuan Xu
Stochastic greedy algorithms for maximizing constrained submodular + supermodular functions. Concurr. Comput. Pract. Exp. 35(17) (2023) - [j21]Kemin Yu, Min Li, Yang Zhou, Qian Liu
On maximizing monotone or non-monotone k-submodular functions with the intersection of knapsack and matroid constraints. J. Comb. Optim. 45(3): 93 (2023) - [c18]Yanfei Li, Min Li, Qian Liu, Yang Zhou:
DR-Submodular Function Maximization with Adaptive Stepsize. COCOON (1) 2023: 347-358 - [c17]YuYing Li, Min Li, Yang Zhou, Qian Liu:
Random Approximation Algorithms for Monotone k-Submodular Function Maximization with Size Constraints. IJTCS-FAW 2023: 116-128 - 2022
- [j20]Min Li, Dachuan Xu
The provably good parallel seeding algorithms for the k-means problem with penalties. Int. Trans. Oper. Res. 29(1): 158-171 (2022) - [j19]Sai Ji, Dachuan Xu
Approximation algorithms for two variants of correlation clustering problem. J. Comb. Optim. 43(5): 933-952 (2022) - [j18]Min Li
The bi-criteria seeding algorithms for two variants of k-means problem. J. Comb. Optim. 44(3): 1693-1704 (2022) - [j17]Sai Ji, Dachuan Xu
The seeding algorithm for spherical k-means clustering with penalties. J. Comb. Optim. 44(3): 1977-1994 (2022) - [j16]Xiaojuan Zhang, Qian Liu, Min Li, Yang Zhou
Fast algorithms for supermodular and non-supermodular minimization via bi-criteria strategy. J. Comb. Optim. 44(5): 3549-3574 (2022) - [j15]Chunying Ren, Dachuan Xu
An improved primal-dual approximation algorithm for the k-means problem with penalties. Math. Struct. Comput. Sci. 32(2): 151-163 (2022) - [j14]Min Li, Hao Xiao, Qian Liu, Yang Zhou
The submodularity of two-stage stochastic maximum-weight independent set problems. Theor. Comput. Sci. 937: 50-62 (2022) - [c16]Kemin Yu, Min Li, Yang Zhou, Qian Liu:
Guarantees for Maximization of k-Submodular Functions with a Knapsack and a Matroid Constraint. AAIM 2022: 156-167 - [c15]Hao Xiao, Qian Liu, Yang Zhou, Min Li:
Non-monotone k-Submodular Function Maximization with Individual Size Constraints. CSoNet 2022: 268-279 - 2021
- [j13]Xingju Cai, Min Li, Guanghui Wang, Dachuan Xu
Preface. Asia Pac. J. Oper. Res. 38(5): 2102002:1-2102002:2 (2021) - [j12]Dongmei Zhang, Yukun Cheng, Min Li, Yishui Wang, Dachuan Xu
Approximation algorithms for spherical k-means problem using local search scheme. Theor. Comput. Sci. 853: 65-77 (2021) - [j11]Qian Liu
Approximation algorithms for fuzzy C-means problem based on seeding method. Theor. Comput. Sci. 885: 146-158 (2021) - [j10]Xin Sun, Dachuan Xu
Deterministic approximation algorithm for submodular maximization subject to a matroid constraint. Theor. Comput. Sci. 890: 1-15 (2021) - [c14]Xiaojuan Zhang, Qian Liu, Min Li, Yang Zhou
Bi-criteria Adaptive Algorithms for Minimizing Supermodular Functions with Cardinality Constraint. AAIM 2021: 179-189 - [c13]Min Li, Qian Liu, Yang Zhou
Two-Stage Stochastic Max-Weight Independent Set Problems. COCOA 2021: 203-213 - [c12]Sai Ji, Min Li, Mei Liang, Zhenning Zhang:
Approximation Algorithm for Min-Max Correlation Clustering Problem with Outliers. COCOA 2021: 668-675 - 2020
- [j9]Min Li, Dachuan Xu
The Parallel Seeding Algorithm for k-Means Problem with Penalties. Asia Pac. J. Oper. Res. 37(4): 2040005:1-2040005:18 (2020) - [j8]Min Li, Dachuan Xu
The seeding algorithm for k-means problem with penalties. J. Comb. Optim. 39(1): 15-32 (2020) - [j7]Min Li, Dachuan Xu
The seeding algorithms for spherical k-means clustering. J. Glob. Optim. 76(4): 695-708 (2020) - [c11]Yang Zhou
A Bi-criteria Analysis for Fuzzy C-means Problem. AAIM 2020: 149-160 - [c10]Jiachen Ju, Min Li, Jianxin Liu, Qian Liu, Yang Zhou
Nonsubmodular Maximization with Knapsack Constraint via Multilinear Extension. PAAP 2020: 81-92 - [c9]Xin Sun, Dachuan Xu
Approximation Guarantees for Deterministic Maximization of Submodular Function with a Matroid Constraint. TAMC 2020: 205-214 - [c8]Qian Liu, Jianxin Liu, Min Li, Yang Zhou
A Novel Initialization Algorithm for Fuzzy C-means Problem. TAMC 2020: 215-225 - [c7]Chunying Ren, Dachuan Xu
A Primal-Dual Algorithm for Euclidean k-Means Problem with Penalties. TAMC 2020: 377-389
2010 – 2019
- 2019
- [j6]Min Li, Dachuan Xu
A Streaming Algorithm for k-Means with Approximate Coreset. Asia Pac. J. Oper. Res. 36(1): 1950006:1-1950006:18 (2019) - [j5]Jin Zhang, Min Li, Yishui Wang, Chenchen Wu, Dachuan Xu
Approximation algorithm for squared metric two-stage stochastic facility location problem. J. Comb. Optim. 38(2): 618-634 (2019) - [j4]Longkun Guo
Efficient approximation algorithms for maximum coverage with group budget constraints. Theor. Comput. Sci. 788: 53-65 (2019) - [c6]Sai Ji, Dachuan Xu
The Seeding Algorithm for Spherical k-Means Clustering with Penalties. AAIM 2019: 149-158 - [c5]Sai Ji, Dachuan Xu
Approximation Algorithm for the Correlation Clustering Problem with Non-uniform Hard Constrained Cluster Sizes. AAIM 2019: 159-168 - [c4]Dongmei Zhang, Yukun Cheng, Min Li, Yishui Wang, Dachuan Xu
Local Search Approximation Algorithms for the Spherical k-Means Problem. AAIM 2019: 341-351 - [c3]Min Li, Yishui Wang, Dachuan Xu
The Seeding Algorithm for Functional k-Means Problem. COCOON 2019: 387-396 - [c2]Sai Ji, Dachuan Xu
Stochastic Greedy Algorithm Is Still Good: Maximizing Submodular + Supermodular Functions. WCGO 2019: 488-497 - 2018
- [j3]Jun Yue
On the double Roman domination of graphs. Appl. Math. Comput. 338: 669-675 (2018) - [j2]Lu Han, Dachuan Xu
Approximation algorithms for the robust facility leasing problem. Optim. Lett. 12(3): 625-637 (2018) - 2017
- [j1]Min Li, Q. Liu:
Inexact feasibility pump for mixed integer nonlinear programming. Inf. Process. Lett. 118: 110-116 (2017) - [c1]Longkun Guo, Min Li, Dachuan Xu
Approximation Algorithms for Maximum Coverage with Group Budget Constraints. COCOA (2) 2017: 362-376
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-15 20:39 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: