Sariel Har-Peled

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 2021Show all

2 papers · 1 filter

cs.CG2021

On the Number of Incidences When Avoiding an Induced Biclique in Geometric Settings

Timothy M. Chan, Sariel Har-Peled

Given a set of points $P$ and a set of regions $O$ , an incidence is a pair $(p, o) \in P \times O$ such that $p \in o$ . We obtain a number of new results on a c…

cs.DS2021★ 1 cited

On Competitive Permutations for Set Cover by Intervals

Sariel Har-Peled, Jiaqi Cheng

We revisit the problem of computing an optimal partial cover of points by intervals. We show that the greedy algorithm computes a permutation $Π = π_{1}, π_{2}, \dots$ of the intervals…