Qingqin Nong
Orcid: 0000-0002-0895-7793Affiliations:
- Ocean University of China, Department of Mathematics, Qingdao, China
According to our database1,
Qingqin Nong
authored at least 34 papers
between 2008 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
Budget-constrained profit maximization without non-negative objective assumption in social networks.
J. Glob. Optim., December, 2024
J. Comb. Optim., May, 2024
Algorithms for Cardinality-Constrained Monotone DR-Submodular Maximization with Low Adaptivity and Query Complexity.
J. Optim. Theory Appl., January, 2024
CoRR, 2024
Mechanism Design with Predictions for Facility Location Games with Candidate Locations.
Proceedings of the Theory and Applications of Models of Computation, 2024
2023
Asia Pac. J. Oper. Res., August, 2023
J. Comb. Optim., April, 2023
Asia Pac. J. Oper. Res., February, 2023
A fast and deterministic algorithm for Knapsack-constrained monotone DR-submodular maximization over an integer lattice.
J. Glob. Optim., 2023
IEEE Access, 2023
2022
J. Comb. Optim., 2022
J. Comb. Optim., 2022
Proceedings of the Frontiers of Algorithmic Wisdom, 2022
2021
Theor. Comput. Sci., 2021
Proceedings of the Combinatorial Optimization and Applications, 2021
2020
A fast algorithm for maximizing a non-monotone DR-submodular integer lattice function.
Theor. Comput. Sci., 2020
Theor. Comput. Sci., 2020
A 1/2-approximation algorithm for maximizing a non-monotone weak-submodular function on a bounded integer lattice.
J. Comb. Optim., 2020
A Survey on Double Greedy Algorithms for Maximizing Non-monotone Submodular Functions.
Proceedings of the Complexity and Approximation - In Memory of Ker-I Ko, 2020
2019
J. Glob. Optim., 2019
Discret. Math. Algorithms Appl., 2019
2018
Asia Pac. J. Oper. Res., 2018
2017
J. Comb. Optim., 2017
2011
2010
A polynomial-time algorithm for the weighted link ring loading problem with integer demand splitting.
Theor. Comput. Sci., 2010
2009
2008
The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan.
Oper. Res. Lett., 2008
An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines.
Oper. Res. Lett., 2008