41 citations · 80 across the 3 of their papers we have counts for
3 papers
cs.DS2005★ 41 cited
Incremental Medians via Online Bidding
Marek Chrobak, Claire Kenyon, John Noga +1
In the k-median problem we are given sets of facilities and customers, and distances between them. For a given set F of facilities, the cost of serving a customer u is the minimum…
math.PR2003★ 2 cited
Glauber Dynamics on Trees and Hyperbolic Graphs
Noam Berger, Claire Kenyon, Elchanan Mossel +1
We study continuous time Glauber dynamics for random configurations with local constraints (e.g. proper coloring, Ising and Potts models) on finite graphs with vertices and of…
cs.DS2002★ 37 cited
Polynomial-Time Approximation Scheme for Data Broadcast
Claire Kenyon, Nicolas Schabanel, Neal Young
The data broadcast problem is to find a schedule for broadcasting a given set of messages over multiple channels. The goal is to minimize the cost of the broadcast plus the expecte…