Recent advances in fully dynamic graph algorithms–a quick reference guide
In recent years, significant advances have been made in the design and analysis of fully
dynamic algorithms. However, these theoretical results have received very little attention …
dynamic algorithms. However, these theoretical results have received very little attention …
Minimum cost flows, MDPs, and ℓ1-regression in nearly linear time for dense instances
In this paper we provide new randomized algorithms with improved runtimes for solving
linear programs with two-sided constraints. In the special case of the minimum cost flow …
linear programs with two-sided constraints. In the special case of the minimum cost flow …
Bipartite matching in nearly-linear time on moderately dense graphs
We present an ̃O(m+n^1.5)-time randomized algorithm for maximum cardinality bipartite
matching and related problems (eg transshipment, negative-weight shortest paths, and …
matching and related problems (eg transshipment, negative-weight shortest paths, and …
Recent advances in fully dynamic graph algorithms
In recent years, significant advances have been made in the design and analysis of fully
dynamic algorithms. However, these theoretical results have received very little attention …
dynamic algorithms. However, these theoretical results have received very little attention …
Hop-constrained expander decompositions, oblivious routing, and distributed universal optimality
This paper studies the fundamental task of establishing routing paths in distributed networks.
We prove the existence of compact routing tables that store in each network-node few …
We prove the existence of compact routing tables that store in each network-node few …
Fast dynamic cuts, distances and effective resistances via vertex sparsifiers
We present a general framework of designing efficient dynamic approximate algorithms for
optimization problems on undirected graphs. In particular, we develop a technique that …
optimization problems on undirected graphs. In particular, we develop a technique that …
Deterministic mincut in almost-linear time
J Li - Proceedings of the 53rd Annual ACM SIGACT …, 2021 - dl.acm.org
We present a deterministic (global) mincut algorithm for weighted, undirected graphs that
runs in m 1+ o (1) time, answering an open question of Karger from the 1990s. To obtain our …
runs in m 1+ o (1) time, answering an open question of Karger from the 1990s. To obtain our …
Deterministic rounding of dynamic fractional matchings
We present a framework for deterministically rounding a dynamic fractional matching.
Applying our framework in a black-box manner on top of existing fractional matching …
Applying our framework in a black-box manner on top of existing fractional matching …
On the range avoidance problem for circuits
We consider the range avoidance problem (called Avoid): given the description of a circuit
with more output gates than input gates, find a string that is not in the range of the circuit …
with more output gates than input gates, find a string that is not in the range of the circuit …
A dynamic shortest paths toolbox: Low-congestion vertex sparsifiers and their applications
We present a general toolbox, based on new vertex sparsifiers, for designing data structures
to maintain shortest paths in graphs undergoing edge insertions and/or deletions. In …
to maintain shortest paths in graphs undergoing edge insertions and/or deletions. In …