
Approximating Fair Clustering with Cascaded Norm Objectives
We introduce the (p,q)Fair Clustering problem. In this problem, we are ...
read it

Improved Approximation Algorithms for Individually Fair Clustering
We consider the kclustering problem with ℓ_pnorm cost, which includes ...
read it

Approximation Algorithms for Socially Fair Clustering
We present an (e^O(p)logℓ/loglogℓ)approximation algorithm for socially ...
read it

On Learned Sketches for Randomized Numerical Linear Algebra
We study "learningbased" sketching approaches for diverse tasks in nume...
read it

(Individual) Fairness for kClustering
We give a local search based algorithm for kmedian (kmeans) clustering...
read it

Improved Local Computation Algorithm for Set Cover via Sparsification
We design a Local Computation Algorithm (LCA) for the set cover problem....
read it

LearningBased LowRank Approximations
We introduce a "learningbased" algorithm for the lowrank decomposition...
read it

NodeWeighted Network Design in Planar and MinorClosed Families of Graphs
We consider nodeweighted survivable network design (SNDP) in planar gra...
read it

(Learned) Frequency Estimation Algorithms under Zipfian Distribution
The frequencies of the elements in a data stream are an important statis...
read it

SampleOptimal LowRank Approximation of Distance Matrices
A distance matrix A ∈ R^n × m represents all pairwise distances, A_ij=d(...
read it

Local Computation Algorithms for Spanners
A graph spanner is a fundamental graph structure that faithfully preserv...
read it

Set Cover in Sublinear Time
We study the classic set cover problem from the perspective of sublinea...
read it

Scalable Fair Clustering
We study the fair variant of the classic kmedian problem introduced by ...
read it

Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class
We develop a new framework for generalizing approximation algorithms fro...
read it
Ali Vakilian
verfied profile