2 papers
cs.CG2026
Near-Optimal Bounds for Parameterized Euclidean k-means
Vincent Cohen-Addad, Karthik C. S., David Saulpic +1
The -means problem is a classic objective for modeling clustering in a metric space. Given a set of points in a metric space, the goal is to find representative points so as…
cs.CG2026
Optimal Bounds for Spanners and Tree Covers in Doubling Metrics
An La, Hung Le, Shay Solomon +4
It is known that any -point set in the -dimensional Euclidean space , for , admits: 1) a -spanner with maximum degree a…