Jason Li

activity

20172026

most citedOn the Fixed-Parameter Tractability of Capacitated Clustering

16 citations · 61 across the 32 of their papers we have counts for

collaborators

Showing 2020Show all

2 papers · 1 filter

cs.DS2020

Near-linear-time, Optimal Vertex Cut Sparsifiers in Directed Acyclic Graphs

Zhiyang He, Jason Li, Magnus Wahlström

Let $G$ be a graph and $S, T \subseteq V (G)$ be (possibly overlapping) sets of terminals, $∣ S ∣ = ∣ T ∣ = k$ . We are interested in computing a vertex sparsifier for terminal cuts in $G$ ,…

cs.DS2020★ 6 cited

Optimal Bounds for the $k$ -cut Problem

Anupam Gupta, David G. Harris, Euiwoong Lee +1

In the $k$ -cut problem, we want to find the lowest-weight set of edges whose deletion breaks a given (multi)graph into $k$ connected components. Algorithms of Karger \& Stein can s…

Near-linear-time, Optimal Vertex Cut Sparsifiers in Directed Acyclic Graphs

Optimal Bounds for the k-cut Problem

Optimal Bounds for the $k$ -cut Problem