Local guarantees in graph cuts and clustering

DOI10.1007/978-3-319-59250-3_12zbMath1418.90218arXiv1704.00355OpenAlexW2610083248MaRDI QIDQ2401152

Roy Schwartz, Neha Gupta, Moses Charikar

Publication date: 31 August 2017

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

zbMATH Keywords

linear programmingapproximation algorithmscorrelation clusteringgraph cuts

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Combinatorial optimization (90C27)

Related Items (7)

Fair correlation clustering with global and local guarantees ⋮ Approximation algorithm for min-max correlation clustering problem with outliers ⋮ \(\ell_p\)-norm multiway cut ⋮ Approximation Algorithms for the Capacitated Min–Max Correlation Clustering Problem ⋮ Efficient enumeration of the optimal solutions to the correlation clustering problem ⋮ Fixed parameter approximation scheme for min-max \(k\)-cut ⋮ Fixed parameter approximation scheme for min-max \(k\)-cut

This page was built for publication: Local guarantees in graph cuts and clustering