A. Vakilian

activity

20152026

most citedTowards Tight Bounds for the Streaming Set Cover Problem

33 citations · 84 across the 22 of their papers we have counts for

collaborators

Showing 2021Show all

2 papers · 1 filter

cs.DS2021

Approximating Fair Clustering with Cascaded Norm Objectives

Eden Chlamtáč, Yury Makarychev, Ali Vakilian

We introduce the $(p, q)$ -Fair Clustering problem. In this problem, we are given a set of points $P$ and a collection of different weight functions $W$ . We would like to find a clus…

cs.DS2021★ 4 cited

Improved Approximation Algorithms for Individually Fair Clustering

Ali Vakilian, Mustafa Yalçıner

We consider the $k$ -clustering problem with $ℓ_{p}$ -norm cost, which includes $k$ -median, $k$ -means and $k$ -center, under an individual notion of fairness proposed by Jung et al.…