Ta-Wei Tu

activity

20222026

collaborators

Showing 2024Show all

3 papers · 1 filter

cs.DS2024

Efficient Matroid Intersection via a Batch-Update Auction Algorithm

Joakim Blikstad, Ta-Wei Tu

Given two matroids $M_{1}$ and $M_{2}$ over the same $n$ -element ground set, the matroid intersection problem is to find a largest common independent set, whose siz…

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

Maximum Flow by Augmenting Paths in $n^{2 + o (1)}$ Time

Aaron Bernstein, Joakim Blikstad, Thatchaphol Saranurak +1

We present a combinatorial algorithm for computing exact maximum flows in directed graphs with $n$ vertices and edge capacities from ${1, \dots, U}$ in $n^{2 + o (1)} lo g U$ time, whi…

Efficient Matroid Intersection via a Batch-Update Auction Algorithm

Matching Composition and Efficient Weight Reduction in Dynamic Matching

Maximum Flow by Augmenting Paths in n2+o(1) Time

Maximum Flow by Augmenting Paths in $n^{2 + o (1)}$ Time