Ling Gai

Orcid: 0000-0003-0710-8498

According to our database1, Ling Gai authored at least 35 papers between 2006 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Fair Transit Stop Placement: A Clustering Perspective and Beyond.
CoRR, February, 2026

2025
Q-BERT4Rec: Quantized Semantic-ID Representation Learning for Multimodal Recommendation.
CoRR, December, 2025

Approximating combinatorial contracts with a cardinality constraint.
J. Comb. Optim., July, 2025

Minimum sum vertex cover: Difficulty of ordering.
Theor. Comput. Sci., 2025

2024
Improved Linear-Time Streaming Algorithms for Maximizing Monotone Cardinality-Constrained Set Functions.
Int. J. Found. Comput. Sci., September, 2024

Online learning under one sided σ-smooth function.
J. Comb. Optim., July, 2024

Two-facility-location games with mixed types of agents.
Appl. Math. Comput., April, 2024

Selfish bin packing with punishment.
Theor. Comput. Sci., January, 2024

Approximating Principal-Agent Problem Under Bayesian.
Proceedings of the Frontiers of Algorithmics - 18th International Joint Conference, 2024

Minimum Sum Vertex Cover: Kernelization and Parameterized Algorithms.
Proceedings of the Computing and Combinatorics - 30th International Conference, 2024

Approximating Continuous Multi-agent Contracts with Lyapunov Function Methods.
Proceedings of the Computing and Combinatorics - 30th International Conference, 2024

2023
Discrete facility location games with different preferences.
J. Comb. Optim., September, 2023

Green supplier selection and order allocation using linguistic Z-numbers MULTIMOORA method and bi-objective non-linear programming.
Fuzzy Optim. Decis. Mak., June, 2023

Effective Heuristic Techniques for Combined Robust Clustering Problem.
Asia Pac. J. Oper. Res., February, 2023

Approximation Algorithms for Spherical k-Means Problem with Penalties Using Local Search Techniques.
Asia Pac. J. Oper. Res., February, 2023

2022
Selfish bin packing under Harmonic mean cost sharing mechanism.
Optim. Lett., 2022

The spherical k-means++ algorithm via local search scheme.
J. Comb. Optim., 2022

An integrated method for hybrid distribution with estimation of demand matching degree.
J. Comb. Optim., 2022

Two-Facility Location Games with Distance Requirement.
Proceedings of the Frontiers of Algorithmic Wisdom, 2022

Online One-Sided Smooth Function Maximization.
Proceedings of the Computing and Combinatorics - 28th International Conference, 2022

Obnoxious Facility Location Games with Candidate Locations.
Proceedings of the Algorithmic Aspects in Information and Management, 2022

2021
Emergency medical center location problem with people evacuation solved by extended TODIM and objective programming.
J. Comb. Optim., 2021

On Various Open-End Bin Packing Game.
Proceedings of the Combinatorial Optimization and Applications, 2021

A Linear-Time Streaming Algorithm for Cardinality-Constrained Maximizing Monotone Non-submodular Set Functions.
Proceedings of the Combinatorial Optimization and Applications, 2021

2020
Selfish Bin Packing with Parameterized Punishment.
Proceedings of the Algorithmic Aspects in Information and Management, 2020

The Spherical k-means++ Algorithm via Local Search.
Proceedings of the Algorithmic Aspects in Information and Management, 2020

Approximation Algorithm for the Balanced 2-correlation Clustering Problem on Well-Proportional Graphs.
Proceedings of the Algorithmic Aspects in Information and Management, 2020

Mixed Distribution of Relief Materials with the Consideration of Demand Matching Degree.
Proceedings of the Algorithmic Aspects in Information and Management, 2020

2019
An integrated method to solve the healthcare facility layout problem under area constraints.
J. Comb. Optim., 2019

2018
Minimum choosability of planar graphs.
J. Comb. Optim., 2018

Online lazy bureaucrat scheduling with a machine deadline.
J. Comb. Optim., 2018

Blocking Rumor by Cut.
J. Comb. Optim., 2018

2009
Hardness of lazy packing and covering.
Oper. Res. Lett., 2009

2008
On lazy bureaucrat scheduling with common deadlines.
J. Comb. Optim., 2008

2006
Common Deadline Lazy Bureaucrat Scheduling Revisited.
Proceedings of the LATIN 2006: Theoretical Informatics, 2006


  Loading...