activity
20112025
most citedFast Clustering with Lower Bounds: No Customer too Far, No Shop too Small

11 citations · 16 across the 5 of their papers we have counts for

collaborators
Showing cs.CGShow all

2 papers · 1 filter

cs.CG2013★ 11 cited

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…

cs.CG2011

Geometric Packing under Non-uniform Constraints

Alina Ene, Sariel Har-Peled, Benjamin Raichel

We study the problem of discrete geometric packing. Here, given weighted regions (say in the plane) and points (with capacities), one has to pick a maximum weight subset of the reg…