2 citations · 2 across the 6 of their papers we have counts for
5 papers · 1 filter
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}{…
Local Spanners Revisited
Stav Ashur, Sariel Har-Peled
For a set of points …
On Undecided LP, Clustering and Active Learning
Stav Ashur, Sariel Har-Peled
We study colored coverage and clustering problems. Here, we are given a colored point set where the points are covered by (unknown) clusters, which are monochromatic (i.e., all…
A 4-Approximation of the -MST
Stav Ashur, Matthew J. Katz
Bounded-angle (minimum) spanning trees were first introduced in the context of wireless networks with directional antennas. They are reminiscent of bounded-degree spanning trees, w…
A Constant-Factor Approximation Algorithm for Vertex Guarding a WV-Polygon
Stav Ashur, Omrit Filtser, Matthew J. Katz
The problem of vertex guarding a simple polygon was first studied by Subir K. Ghosh (1987), who presented a polynomial-time -approximation algorithm for placing as few g…