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

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

collaborators

2 papers

cs.DS2016

Routing under Balance

Alina Ene, Gary Miller, Jakub Pachocki +1

We introduce the notion of balance for directed graphs: a weighted directed graph is -balanced if for every cut , the total weight of edges going from to $V\s…

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…