8 papers
Bellman-Ford in Almost-Linear Time
Isaac M. Hair, George Z. Li, Jason Li +1
We consider the single-source shortest paths problem on a directed graph with real-valued (possibly negative) edge weights and solve this problem in time.
Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths
Isaac M. Hair, George Z. Li, Jason Li +1
We revisit the single-source shortest paths (SSSP) problem on directed graphs with nonnegative real weights and give a deterministic parallel algorithm with $O(n^{1+o(1)}t^2 + m^{1…
The Dirichlet Mechanism for rounding with strong negative correlation, with applications
David G. Harris, George Z. Li, Nitya Raju +1
Many optimization and scheduling problems can be abstracted in terms of a bipartite ``assignment graph" , where the goal is to select exactly one edge for each r…
Shortcutting for Negative-Weight Shortest Path
George Z. Li, Jason Li, Satish Rao +1
Consider the single-source shortest paths problem on a directed graph with real-valued edge weights. We solve this problem in time, improving on prior work…
Improved Directed Expander Decompositions
Henry Fleischmann, George Z. Li, Jason Li
We obtain faster expander decomposition algorithms for directed graphs, matching the guarantees of Saranurak and Wang (SODA 2019) for expander decomposition on undirected graphs. O…
Faster Weak Expander Decompositions and Approximate Max Flow
Henry Fleischmann, George Z. Li, Jason Li
We give faster algorithms for weak expander decompositions and approximate max flow on undirected graphs. First, we show that it is possible to "warm start" the cut-matching game w…