4 papers
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…
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…
A Query-Driven Approach to Space-Efficient Range Searching
Dimitris Fotakis, Andreas Kalavas, Ioannis Psarros
We initiate a study of a query-driven approach to designing partition trees for range-searching problems. Our model assumes that a data structure is to be built for an unknown quer…
Faster Approximation Algorithms for k-Center via Data Reduction
Arnold Filtser, Shaofeng H. -C. Jiang, Yi Li +4
We study efficient algorithms for the Euclidean -Center problem, focusing on the regime of large . We take the approach of data reduction by considering -coreset, which i…