First nontrivial O(sqrt(log n * max{log |E^-|, log k})) approximation for min-max correlation clustering on weighted graphs, with improved bounds for K_{r,r}-minor-free graphs and complete graphs.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Min-Max Correlation Clustering via MultiCut
First nontrivial O(sqrt(log n * max{log |E^-|, log k})) approximation for min-max correlation clustering on weighted graphs, with improved bounds for K_{r,r}-minor-free graphs and complete graphs.