research
∙
08/28/2023
Faster Min-Cost Flow on Bounded Treewidth Graphs
We present a O(m√(τ)+nτ) time algorithm for finding a minimum-cost flow ...
share
research
∙
07/30/2023
Polytopes with Bounded Integral Slack Matrices Have Sub-Exponential Extension Complexity
We show that any bounded integral function f : A × B ↦{0,1, …, Δ} with r...
research
∙
08/07/2022
Decomposable Non-Smooth Convex Optimization with Nearly-Linear Gradient Oracle Complexity
Many fundamental problems in machine learning can be formulated by the c...
research
∙
05/03/2022
Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time
We present a nearly-linear time algorithm for finding a minimum-cost flo...
research
∙
11/10/2020
A Nearly-Linear Time Algorithm for Linear Programs with Small Treewidth: A Multiscale Representation of Robust Central Path
Arising from structural graph theory, treewidth has become a focus of st...
research
∙
11/01/2019