Min-max correlation clustering via multicut

DOI10.1007/978-3-030-17953-3_2zbMath1436.90114arXiv1907.00117OpenAlexW2943534729MaRDI QIDQ2293081

Saba Ahmadi, Samir Khuller, Barna Saha

Publication date: 6 February 2020

Full work available at URL: https://arxiv.org/abs/1907.00117

zbMATH Keywords

approximation algorithmscorrelation clusteringmulticut

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (8)

Fair correlation clustering with global and local guarantees ⋮ An improved approximation algorithm for capacitated correlation clustering problem ⋮ Approximation algorithm for the capacitated correlation clustering problem with penalties ⋮ \(\ell_p\)-norm multiway cut ⋮ Approximation algorithms for the lower bounded correlation clustering problem ⋮ Fixed parameter approximation scheme for min-max \(k\)-cut ⋮ Fixed parameter approximation scheme for min-max \(k\)-cut ⋮ Approximation algorithms for the capacitated correlation clustering problem with penalties

This page was built for publication: Min-max correlation clustering via multicut