Aditya Anand

most citedApproximating Small Sparse Cuts

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

collaborators

3 papers

cs.DS2024★ 1 cited

Unbreakable Decomposition in Close-to-Linear Time

Aditya Anand, Euiwoong Lee, Jason Li +2

Unbreakable decomposition, introduced by Cygan et al. (SICOMP'19) and Cygan et al. (TALG'20), has proven to be one of the most powerful tools for parameterized graph cut problems i…

cs.DS2024★ 1 cited

Approximating Small Sparse Cuts

Aditya Anand, Euiwoong Lee, Jason Li +1

We study polynomial-time approximation algorithms for (edge/vertex) Sparsest Cut and Small Set Expansion in terms of $k$ , the number of edges or vertices cut in the optimal solutio…

cs.DS2024

Separating $k$ -Median from the Supplier Version

Aditya Anand, Euiwoong Lee

Given a metric space $(V, d)$ along with an integer $k$ , the $k$ -Median problem asks to open $k$ centers $C \subseteq V$ to minimize $\sum_{v \in V} d (v, C)$ , where $d(v, C) := \mi…

Unbreakable Decomposition in Close-to-Linear Time

Approximating Small Sparse Cuts

Separating k-Median from the Supplier Version

Separating $k$ -Median from the Supplier Version