Min Li
Orcid: 0000-0003-2784-5073Affiliations:
- 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:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
2023
On maximizing monotone or non-monotone k-submodular functions with the intersection of knapsack and matroid constraints.
J. Comb. Optim., April, 2023
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
Proceedings of the Computing and Combinatorics - 29th International Conference, 2023
2022
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
J. Comb. Optim., 2022
J. Comb. Optim., 2022
J. Comb. Optim., 2022
The provably good parallel seeding algorithms for the k-means problem with penalties.
Int. Trans. Oper. Res., 2022
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
Theor. Comput. Sci., 2021
Proceedings of the Combinatorial Optimization and Applications, 2021
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
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
Proceedings of the Theory and Applications of Models of Computation, 2020
Proceedings of the Theory and Applications of Models of Computation, 2020
Proceedings of the Parallel Architectures, Algorithms and Programming, 2020
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
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
Proceedings of the Computing and Combinatorics - 25th International Conference, 2019
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
2017
Inf. Process. Lett., 2017
Proceedings of the Combinatorial Optimization and Applications, 2017