Aaron Sidford

activity

20232026

collaborators

Showing 2024Show all

2 papers · 1 filter

cs.DS2024

Matching Composition and Efficient Weight Reduction in Dynamic Matching

Aaron Bernstein, Jiale Chen, Aditi Dudeja +3

We consider the foundational problem of maintaining a $(1 - ε)$ -approximate maximum weight matching (MWM) in an $n$ -node dynamic graph undergoing edge insertions and deleti…

cs.DS2024

Eulerian Graph Sparsification by Effective Resistance Decomposition

Arun Jambulapati, Sushant Sachdeva, Aaron Sidford +2

We provide an algorithm that, given an $n$ -vertex $m$ -edge Eulerian graph with polynomially bounded weights, computes an $O ˘ (n lo g^{2} n \cdot ε^{- 2})$ -edge $\vare…