Qingqin Nong

Orcid: 0000-0002-0895-7793

Affiliations:
  • 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:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Budget-constrained profit maximization without non-negative objective assumption in social networks.
J. Glob. Optim., December, 2024

Constrained heterogeneous two-facility location games with sum-variant.
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

The Fairness of Maximum Nash Social Welfare Under Matroid Constraints and Beyond.
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
Maximize Liquid Welfare in Combinatorial Auctions with Monotone Valuations.
Asia Pac. J. Oper. Res., August, 2023

Constrained heterogeneous facility location games with max-variant cost.
J. Comb. Optim., April, 2023

Preface.
Asia Pac. J. Oper. Res., February, 2023

Uncertainty in Study of Social Networks: Robust Optimization and Machine Learning.
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

Regularized Submodular Maximization With a k-Matroid Intersection Constraint.
IEEE Access, 2023

2022
Bounding quality of pure Nash equilibria in dual-role facility location games.
J. Comb. Optim., 2022

Strategyproof mechanisms for 2-facility location games with minimax envy.
J. Comb. Optim., 2022

Constrained Heterogeneous Two-Facility Location Games with Max-Variant Cost.
Proceedings of the Frontiers of Algorithmic Wisdom, 2022

2021
Multiple facility location games with envy ratio.
Theor. Comput. Sci., 2021

Maximize a monotone function with a generic submodularity ratio.
Theor. Comput. Sci., 2021

An improved mechanism for selfish bin packing.
J. Comb. Optim., 2021

The Price of Anarchy of Generic Valid Utility Systems.
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

General Rumor Blocking: An efficient random algorithm with martingale approach.
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

Facility location game with envy ratio.
Comput. Ind. Eng., 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
Parametric monotone function maximization with matroid constraints.
J. Glob. Optim., 2019

A bin packing game with cardinality constraints under the best cost rule.
Discret. Math. Algorithms Appl., 2019

2018
Bin packing game with a price of anarchy of 3/2.
J. Comb. Optim., 2018

A Coordination Mechanism for a Scheduling Game with Uniform-Batching Machines.
Asia Pac. J. Oper. Res., 2018

2017
A coordination mechanism for a scheduling game with parallel-batching machines.
J. Comb. Optim., 2017

Centralized and decentralized rumor blocking problems.
J. Comb. Optim., 2017

2011
Two-agent scheduling to minimize the total cost.
Eur. J. Oper. Res., 2011

2010
A polynomial-time algorithm for the weighted link ring loading problem with integer demand splitting.
Theor. Comput. Sci., 2010

2009
The weighted link ring loading problem.
J. Comb. Optim., 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


  Loading...