Aditya Anand

activity

20242026

most citedApproximating Small Sparse Cuts

1 citations · 2 across the 7 of their papers we have counts for

collaborators

Showing 2026Show all

3 papers · 1 filter

cs.DS2026

Greedy Region Growing: Improved Approximations for Cutwidth, Pathwidth, Flow-Expander Decomposition, and More

Aditya Anand

We give a new rounding technique for spreading-metric linear programs, called Greedy Region Growing, which adapts the classical technique of region growing to min-max graph layout…

cs.DS2026

Socially Fair Clustering: Parameterized Approximation and Local Search

Aditya Anand, Yury Makarychev, Liren Shan

We study the Socially Fair Clustering problem introduced by Abbasi, Bhaskara, and Venkatasubramanian (2021) and Ghadiri, Samadi, and Vempala (2021), along with its extension, the $…

cs.DS2026

Spectral Dual Fitting for $k$ -Means

Aditya Anand, Moses Charikar, Vincent Cohen-Addad +5

We give a new dual fitting algorithm which gives improved approximation ratios of $3 + ln 2 + ε (\approx 3.694)$ and $4.9 + ε$ for $k$ -Means in (high-dimensional) Euclidean and genera…

Greedy Region Growing: Improved Approximations for Cutwidth, Pathwidth, Flow-Expander Decomposition, and More

Socially Fair Clustering: Parameterized Approximation and Local Search

Spectral Dual Fitting for k-Means

Spectral Dual Fitting for $k$ -Means