3 citations · 3 across the 2 of their papers we have counts for
4 papers
Deterministic Spectral Sparsification in Almost-Linear Time for Dense Graphs
Jason Li, Trevor Vaughn
A spectral sparsifier of a weighted graph is a reweighted subgraph whose Laplacian quadratic form approximates that of the original graph. Let be a positively weighted -vert…
Deterministic Mincut in Almost-Linear Time
Jason Li
We present a deterministic (global) mincut algorithm for weighted, undirected graphs that runs in time, answering an open question of Karger from the 1990s. To obtain…
Matroid-Based TSP Rounding for Half-Integral Solutions
Anupam Gupta, Euiwoong Lee, Jason Li +3
We show how to round any half-integral solution to the subtour-elimination relaxation for the TSP, while losing a less-than-1.5 factor. Such a rounding algorithm was recently given…
Distributed Treewidth Computation and Courcelle's Theorem in the CONGEST Model
Benjamin Jauregui, Jason Li, Pedro Montealegre +1
Algorithmic meta-theorems, stating that graph properties expressible in some particular logic can be decided efficiently in graph classes having some specific structural properties…