Fair correlation clustering with global and local guarantees

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

Authors: 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

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

Cites Work

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

Cited In (1)

• The structural complexity landscape of finding balance-fair shortest paths

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832884)