7 citations · 7 across the 5 of their papers we have counts for
Showing cs.CGShow all
3 papers · 1 filter
cs.CG2026
Capacitated Clustering with Few Extra Centers
Kangke Cheng, Guanlin Mo, Hu Ding
In capacitated -clustering, we open centers and assign every client to a center within its capacity, minimizing the sum of -th powers of the distances; -median and…
cs.CG2026
The Stretch Factor of Planar Delaunay Triangulations Is Less Than 1.5949
Guanlin Mo, Kangke Cheng, Hu Ding
Delaunay triangulations are the classical plane spanners: the shortest path between two vertices is at most a constant times as long as the segment between them. Determining the sm…
cs.CG2026
A Tight 3-Approximation for Fair -Means
Kangke Cheng, Guanlin Mo, Shihong Song +1
Fairness in clustering has attracted sustained research interest, motivated by the need to ensure equitable representation of protected groups in machine learning applications. We…