3 papers
cs.CG2021
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…
cs.CG2020
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…
cs.CG2019
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…