2 papers
cs.DS2025
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…
cs.DS2025
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 is…