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.
We present a scalable algorithm for the individually fair ($p$, $k$)-clustering problem introduced by Jung et al. and Mahabadi et al. Given $n$ points $P$ in a metric space, let $δ(x)$ for $x\in P$ be the radius of the smallest ball around $x$ containing at least $n / k$ points. A clustering is then called individually fair if it has centers within distance $δ(x)$ of $x$ for each $x\in P$. While good approximation algorithms are known for this problem no efficient practical algorithms with good theoretical guarantees have been presented. We design the first fast local-search algorithm that runs in ~$O(nk^2)$ time and obtains a bicriteria $(O(1), 6)$ approximation. Then we show empirically that not only is our algorithm much faster than prior work, but it also produces lower-cost solutions.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2402.06730")
get_code_for_paper("2402.06730")
have("2402.06730")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2402.06730.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2402.06730)
Connect an agent — have() is free.