3 citations · 3 across the 2 of their papers we have counts for
4 papers · 1 filter
Online Correlation Clustering with Metric Weights
Sami Davies, Benjamin Moseley, Heather Newman
The standard online version of correlation clustering is prohibitively hard, as even randomized algorithms cannot achieve competitive ratio better than . Prior works bypass t…
Robust Gittins for Stochastic Scheduling
Benjamin Moseley, Heather Newman, Kirk Pruhs +1
A common theme in stochastic optimization problems is that, theoretically, stochastic algorithms need to "know" relatively rich information about the underlying distributions. This…
Simultaneously Approximating All -norms in Correlation Clustering
Sami Davies, Benjamin Moseley, Heather Newman
This paper considers correlation clustering on unweighted complete graphs. We give a combinatorial algorithm that returns a single clustering solution that is simultaneously …
Online -Median with Consistent Clusters
Benjamin Moseley, Heather Newman, Kirk Pruhs
We consider the online -median clustering problem in which points arrive online and must be irrevocably assigned to a cluster on arrival. As there are lower bound instances…