272 citations · 611 across the 76 of their papers we have counts for
5 papers · 1 filter
Quasi-Polynomial Time Approximation Scheme for Sparse Subsets of Polygons
Sariel Har-Peled
We describe how to approximate, in quasi-polynomial time, the largest independent set of polygons, in a given set of polygons. Our algorithm works by extending the result of Adamas…
On the Number of Edges of Fan-Crossing Free Graphs
Otfried Cheong, Sariel Har-Peled, Heuna Kim +1
A graph drawn in the plane with n vertices is k-fan-crossing free for k > 1 if there are no k+1 edges , such that have a common endpoint and cros…
Fast Clustering with Lower Bounds: No Customer too Far, No Shop too Small
Alina Ene, Sariel Har-Peled, Benjamin Raichel
We study the \LowerBoundedCenter (\lbc) problem, which is a clustering problem that can be viewed as a variant of the \kCenter problem. In the \lbc problem, we are given a set of p…
Approximating Minimization Diagrams and Generalized Proximity Search
Sariel Har-Peled, Nirman Kumar
We investigate the classes of functions whose minimization diagrams can be approximated efficiently in \Re^d. We present a general framework and a data-structure that can be used t…
Peeling the Grid
Sariel Har-Peled, Bernard Lidický
Consider the set of points formed by the integer grid, and the process that in each iteration removes from the point set the vertices of its convex-hull. Here, we prov…