activity
20112026
most citedTowards Tight Bounds for the Streaming Set Cover Problem

33 citations · 45 across the 30 of their papers we have counts for

collaborators
Showing 2023Show all

6 papers · 1 filter

cs.CG2023

On the Rectangles Induced by Points

Stav Ashur, Sariel Har-Peled

$ \newcommand{\Re}{\mathbb{R}} \newcommand{\reals}{\mathbb{R}} \newcommand{\SetX}{\mathsf{X}} \newcommand{\rad}{r} \newcommand{\Mh}[1]{#1} \newcommand{\query}{q} \newcommand{\eps}{…

cs.CG2023

Fast Approximation Algorithms for Piercing Boxes by Points

Pankaj K. Agarwal, Sariel Har-Peled, Rahul Raychaudhury +1

$\newcommand{\popt}{\mathcal{p}} \newcommand{\Re}{\mathbb{R}}\newcommand{\N}{\mathcal{N}} \newcommand{\BX}{\mathcal{B}} \newcommand{\bb}{\mathsf{b}} \newcommand{\eps}{\varepsilon}…

cs.CG2023

Near-Optimal Euclidean Locality-Sensitive Orderings

Zhimeng Gao, Sariel Har-Peled

$ \newcommand{\Re}{\mathbb{R}} \newcommand{\reals}{\mathbb{R}} \newcommand{\SetX}{\mathsf{X}} \newcommand{\rad}{r} \newcommand{\Eps}{\Mh{\mathcal{E}}} \newcommand{\p}{\Mh{p}} \newc…

cs.CG2023

Approximately: Independence Implies Vertex Cover

Sariel Har-Peled

We observe that a $(1-\eps)$-approximation algorithm to Independent Set, that works for any induced subgraph of the input graph, can be used, via a…

cs.CG2023

On the Budgeted Hausdorff Distance Problem

Sariel Har-Peled, Benjamin Raichel

$ \newcommand{\Re}{\mathbb{R}} \newcommand{\reals}{\mathbb{R}} \newcommand{\SetX}{\mathsf{X}} \newcommand{\optX}[1]{#1^\star} \newcommand{\Qopt}{\Mh{\optX{Q}}} \newcommand{\rad}{r}…

cs.CG2023

No-dimensional Tverberg Partitions Revisited

Sariel Har-Peled, Eliot W. Robson

$ \newcommand{\epsA}{\Mhδ} \newcommand{\Re}{\mathbb{R}} \newcommand{\reals}{\mathbb{R}} \newcommand{\SetX}{\mathsf{X}} \renewcommand¶{P} \newcommand{\diam}Δ \newcommand{\Mh}[1]{#1}…