First optimal algorithm for fair top-k aggregation and 2-approximation for fair full rank aggregation under Spearman footrule (L1 distance).
arXiv preprint arXiv:2002.03508 , year=
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
cs.DS 3verdicts
UNVERDICTED 3representative citing papers
Defines multilayer correlation clustering and provides an O(L log n)-approximation algorithm plus a 4-approximation for the probability-constrained special case.
The thesis gives the first non-trivial dual fault-tolerant pairwise reachability preservers of size O(n^{4/3}|P|^{1/3}) and new approximation algorithms plus a streaming method for fair clustering in graphs.
citing papers explorer
-
Fairness in Aggregation: Optimal Top-$k$ and Improved Full Ranking
First optimal algorithm for fair top-k aggregation and 2-approximation for fair full rank aggregation under Spearman footrule (L1 distance).
-
Multilayer Correlation Clustering
Defines multilayer correlation clustering and provides an O(L log n)-approximation algorithm plus a 4-approximation for the probability-constrained special case.
-
Creating Robust and Fair Graph Structures for Connectivity and Clustering
The thesis gives the first non-trivial dual fault-tolerant pairwise reachability preservers of size O(n^{4/3}|P|^{1/3}) and new approximation algorithms plus a streaming method for fair clustering in graphs.