109 citations · 266 across the 23 of their papers we have counts for
5 papers · 1 filter
Optimal Approximation -- Smoothness Tradeoffs for Soft-Max Functions
Alessandro Epasto, Mohammad Mahdian, Vahab Mirrokni +1
A soft-max function has two main efficiency measures: (1) approximation - which corresponds to how well it approximates the maximum function, (2) smoothness - which shows how sensi…
Fair Hierarchical Clustering
Sara Ahmadian, Alessandro Epasto, Marina Knittel +6
As machine learning has become more prevalent, researchers have begun to recognize the necessity of ensuring machine learning systems are fair. Recently, there has been an interest…
Sliding Window Algorithms for k-Clustering Problems
Michele Borassi, Alessandro Epasto, Silvio Lattanzi +2
The sliding window model of computation captures scenarios in which data is arriving continuously, but only the latest elements should be used for analysis. The goal is to desi…
Fair Correlation Clustering
Sara Ahmadian, Alessandro Epasto, Ravi Kumar +1
In this paper, we study correlation clustering under fairness constraints. Fair variants of -median and -center clustering have been studied recently, and approximation algor…
Fair Correlation Clustering
Saba Ahmadi, Sainyam Galhotra, Barna Saha +1
In this paper we study the problem of correlation clustering under fairness constraints. In the classic correlation clustering problem, we are given a complete graph where each edg…