We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
In this paper, we study correlation clustering under fairness constraints. Fair variants of $k$-median and $k$-center clustering have been studied recently, and approximation algorithms using a notion called fairlet decomposition have been proposed. We obtain approximation algorithms for fair correlation clustering under several important types of fairness constraints. Our results hinge on obtaining a fairlet decomposition for correlation clustering by introducing a novel combinatorial optimization problem. We define a fairlet decomposition with cost similar to the $k$-median cost and this allows us to obtain approximation algorithms for a wide range of fairness constraints. We complement our theoretical results with an in-depth analysis of our algorithms on real graphs where we show that fair solutions to correlation clustering can be obtained with limited increase in cost compared to the state-of-the-art (unfair) algorithms.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2002.02274")
get_code_for_paper("2002.02274")
have("2002.02274")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2002.02274.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2002.02274)
Connect an agent — have() is free.