Fair correlation clustering with global and local guarantees

DOI10.1007/978-3-030-83508-8_30OpenAlexW3190367304MaRDI QIDQ832884

Zachary Friggstad, Ramin Mousavi

Publication date: 25 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-83508-8_30

zbMATH Keywords

correlation clusteringfair clusteringglobal objectivelocal objective

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Data structures (68P05)

Related Items (1)

The structural complexity landscape of finding balance-fair shortest paths

Cites Work

• Correlation clustering
• Fair coresets and streaming algorithms for fair \(k\)-means
• Min-max correlation clustering via multicut
• Local guarantees in graph cuts and clustering
• Clustering with qualitative information
• Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs
• Correlation Clustering and Biclustering With Locally Bounded Errors
• Aggregating inconsistent information

This page was built for publication: Fair correlation clustering with global and local guarantees