7 citations · 15 across the 11 of their papers we have counts for
3 papers · 1 filter
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 …
Predictive Flows for Faster Ford-Fulkerson
Sami Davies, Benjamin Moseley, Sergei Vassilvitskii +1
Recent work has shown that leveraging learned predictions can improve the running time of algorithms for bipartite matching and similar combinatorial problems. In this work, we bui…
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…