Heather Newman

activity

20172026

most citedRobust Gittins for Stochastic Scheduling

3 citations · 5 across the 4 of their papers we have counts for

collaborators

Showing 2023Show all

3 papers · 1 filter

cs.DS2023

Simultaneously Approximating All $ℓ_{p}$ -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 $O (1)$ …

cs.DS2023

Online $k$ -Median with Consistent Clusters

Benjamin Moseley, Heather Newman, Kirk Pruhs

We consider the online $k$ -median clustering problem in which $n$ points arrive online and must be irrevocably assigned to a cluster on arrival. As there are lower bound instances…

cs.DS2023

Fast Combinatorial Algorithms for Min Max Correlation Clustering

Sami Davies, Benjamin Moseley, Heather Newman

We introduce fast algorithms for correlation clustering with respect to the Min Max objective that provide constant factor approximations on complete graphs. Our algorithms are the…

Simultaneously Approximating All ℓp​-norms in Correlation Clustering

Online k-Median with Consistent Clusters

Fast Combinatorial Algorithms for Min Max Correlation Clustering

Simultaneously Approximating All $ℓ_{p}$ -norms in Correlation Clustering

Online $k$ -Median with Consistent Clusters