Showing 2026Show all
2 papers · 1 filter
cs.DS2026
Near Linear Time Approximation Schemes for Clustering of Partially Doubling Metrics
Anne Driemel, Jan Höckendorff, Ioannis Psarros +2
Given a finite metric space the -median problem is to find a set of centers that minimizes $\sum_{p\in X} \min_{c\in C} \mathbf{d}(p,c…
cs.CG2026
Space-Efficient Approximate Spherical Range Counting in High Dimensions
Andreas Kalavas, Ioannis Psarros
We study the following range searching problem in high-dimensional Euclidean spaces: given a finite set , where each is assigned a weight , and…