Min Li

Orcid: 0000-0003-2784-5073

Affiliations:
  • Shandong Normal University, School of Mathematics and Statistics, Jinan, China


According to our database1, Min Li authored at least 41 papers between 2017 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Differentially private k-center problems.
Optim. Lett., November, 2024

2023
On maximizing monotone or non-monotone k-submodular functions with the intersection of knapsack and matroid constraints.
J. Comb. Optim., April, 2023

Approximation Algorithms for Matroid and Knapsack Means Problems.
Asia Pac. J. Oper. Res., February, 2023

Stochastic greedy algorithms for maximizing constrained submodular + supermodular functions.
Concurr. Comput. Pract. Exp., 2023

Random Approximation Algorithms for Monotone k-Submodular Function Maximization with Size Constraints.
Proceedings of the Frontiers of Algorithmics - 17th International Joint Conference, 2023

DR-Submodular Function Maximization with Adaptive Stepsize.
Proceedings of the Computing and Combinatorics - 29th International Conference, 2023

2022
The submodularity of two-stage stochastic maximum-weight independent set problems.
Theor. Comput. Sci., 2022

An improved primal-dual approximation algorithm for the k-means problem with penalties.
Math. Struct. Comput. Sci., 2022

Fast algorithms for supermodular and non-supermodular minimization via bi-criteria strategy.
J. Comb. Optim., 2022

The bi-criteria seeding algorithms for two variants of k-means problem.
J. Comb. Optim., 2022

Approximation algorithms for two variants of correlation clustering problem.
J. Comb. Optim., 2022

The seeding algorithm for spherical k-means clustering with penalties.
J. Comb. Optim., 2022

The provably good parallel seeding algorithms for the k-means problem with penalties.
Int. Trans. Oper. Res., 2022

Non-monotone k-Submodular Function Maximization with Individual Size Constraints.
Proceedings of the Computational Data and Social Networks - 11th International Conference, 2022

Guarantees for Maximization of k-Submodular Functions with a Knapsack and a Matroid Constraint.
Proceedings of the Algorithmic Aspects in Information and Management, 2022

2021
Approximation algorithms for spherical <i>k</i>-means problem using local search scheme.
Theor. Comput. Sci., 2021

Deterministic approximation algorithm for submodular maximization subject to a matroid constraint.
Theor. Comput. Sci., 2021

Approximation algorithms for fuzzy <i>C</i>-means problem based on seeding method.
Theor. Comput. Sci., 2021

Preface.
Asia Pac. J. Oper. Res., 2021

Two-Stage Stochastic Max-Weight Independent Set Problems.
Proceedings of the Combinatorial Optimization and Applications, 2021

Approximation Algorithm for Min-Max Correlation Clustering Problem with Outliers.
Proceedings of the Combinatorial Optimization and Applications, 2021

Bi-criteria Adaptive Algorithms for Minimizing Supermodular Functions with Cardinality Constraint.
Proceedings of the Algorithmic Aspects in Information and Management, 2021

2020
The seeding algorithms for spherical k-means clustering.
J. Glob. Optim., 2020

The seeding algorithm for k-means problem with penalties.
J. Comb. Optim., 2020

The Parallel Seeding Algorithm for k-Means Problem with Penalties.
Asia Pac. J. Oper. Res., 2020

Approximation Guarantees for Deterministic Maximization of Submodular Function with a Matroid Constraint.
Proceedings of the Theory and Applications of Models of Computation, 2020

A Primal-Dual Algorithm for Euclidean <i>k</i>-Means Problem with Penalties.
Proceedings of the Theory and Applications of Models of Computation, 2020

A Novel Initialization Algorithm for Fuzzy <i>C</i>-means Problem.
Proceedings of the Theory and Applications of Models of Computation, 2020

Nonsubmodular Maximization with Knapsack Constraint via Multilinear Extension.
Proceedings of the Parallel Architectures, Algorithms and Programming, 2020

A Bi-criteria Analysis for Fuzzy C-means Problem.
Proceedings of the Algorithmic Aspects in Information and Management, 2020

2019
Efficient approximation algorithms for maximum coverage with group budget constraints.
Theor. Comput. Sci., 2019

Approximation algorithm for squared metric two-stage stochastic facility location problem.
J. Comb. Optim., 2019

A Streaming Algorithm for k-Means with Approximate Coreset.
Asia Pac. J. Oper. Res., 2019

Stochastic Greedy Algorithm Is Still Good: Maximizing Submodular + Supermodular Functions.
Proceedings of the Optimization of Complex Systems: Theory, 2019

The Seeding Algorithm for Functional k-Means Problem.
Proceedings of the Computing and Combinatorics - 25th International Conference, 2019

Local Search Approximation Algorithms for the Spherical k-Means Problem.
Proceedings of the Algorithmic Aspects in Information and Management, 2019

Approximation Algorithm for the Correlation Clustering Problem with Non-uniform Hard Constrained Cluster Sizes.
Proceedings of the Algorithmic Aspects in Information and Management, 2019

2018
Approximation algorithms for the robust facility leasing problem.
Optim. Lett., 2018

On the double Roman domination of graphs.
Appl. Math. Comput., 2018

2017
Inexact feasibility pump for mixed integer nonlinear programming.
Inf. Process. Lett., 2017

Approximation Algorithms for Maximum Coverage with Group Budget Constraints.
Proceedings of the Combinatorial Optimization and Applications, 2017


  Loading...