Jason Li

most citedAn FPT Algorithm Beating 2-Approximation for

k

-Cut

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

collaborators

3 papers

cs.DS2019

The Number of Minimum $k$ -Cuts: Improving the Karger-Stein Bound

Anupam Gupta, Euiwoong Lee, Jason Li

Given an edge-weighted graph, how many minimum $k$ -cuts can it have? This is a fundamental question in the intersection of algorithms, extremal combinatorics, and graph theory. It…

cs.DS2019

Tight FPT Approximations for $k$ -Median and $k$ -Means

Vincent Cohen-Addad, Anupam Gupta, Amit Kumar +2

We investigate the fine-grained complexity of approximating the classical $k$ -median / $k$ -means clustering problems in general metric spaces. We show how to improve the approximat…

cs.DS2017★ 2 cited

An FPT Algorithm Beating 2-Approximation for $k$ -Cut

Anupam Gupta, Euiwoong Lee, Jason Li

In the $k$ -Cut problem, we are given an edge-weighted graph $G$ and an integer $k$ , and have to remove a set of edges with minimum total weight so that $G$ has at least $k$ connect…

The Number of Minimum k-Cuts: Improving the Karger-Stein Bound

Tight FPT Approximations for k-Median and k-Means

An FPT Algorithm Beating 2-Approximation for k-Cut

The Number of Minimum $k$ -Cuts: Improving the Karger-Stein Bound

Tight FPT Approximations for $k$ -Median and $k$ -Means

An FPT Algorithm Beating 2-Approximation for $k$ -Cut