Set cover and hitting set are fundamental problems in combinatorial
opti...
In the orthogonal range reporting problem we must pre-process a set P of...
This paper studies a multi-armed bandit (MAB) version of the range-searc...
Range closest-pair (RCP) search is a range-search variant of the classic...
Consider a set P ⊆R^d of n points, and a convex body
C provided via a se...
In this paper, we consider a range-search variant of the closest-pair
pr...
In this work, we present a collection of new results on two fundamental
...
Given a dataset S of points in R^2, the range closest-pair (RCP)
problem...