21 citations · 125 across the 23 of their papers we have counts for
4 papers · 1 filter
Self-improving Algorithms for Coordinate-Wise Maxima and Convex Hulls
Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri
Finding the coordinate-wise maxima and the convex hull of a planar point set are probably the most classic problems in computational geometry. We consider these problems in the sel…
Self-improving Algorithms for Coordinate-wise Maxima
Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri
Computing the coordinate-wise maxima of a planar point set is a classic and well-studied problem in computational geometry. We give an algorithm for this problem in the \emph{self-…
On the Set Multi-Cover Problem in Geometric Settings
Chandra Chekuri, Kenneth L. Clarkson, Sariel Har-Peled
We consider the set multi-cover problem in geometric settings. Given a set of points P and a collection of geometric shapes (or sets) F, we wish to find a minimum cardinality subse…
Improved Approximation Algorithms for Geometric Set Cover
Kenneth L. Clarkson, Kasturi Varadarajan
Given a collection S of subsets of some set U, and M a subset of U, the set cover problem is to find the smallest subcollection C of S such that M is a subset of the union of the s…