Sally Dong

activity

20172023

most citedA Nearly-Linear Time Algorithm for Linear Programs with Small Treewidth: A Multiscale Representation of Robust Central Path

2 citations · 3 across the 7 of their papers we have counts for

collaborators

Showing 2023Show all

3 papers · 1 filter

cs.DS2023

Fast Algorithms for Separable Linear Programs

Sally Dong, Gramoz Goranci, Lawrence Li +2

In numerical linear algebra, considerable effort has been devoted to obtaining faster algorithms for linear systems whose underlying matrices exhibit structural properties. A promi…

cs.DS2023

Faster Min-Cost Flow and Approximate Tree Decomposition on Bounded Treewidth Graphs

Sally Dong, Guanghao Ye

We present an algorithm for min-cost flow in graphs with $n$ vertices and $m$ edges, given a tree decomposition of width $τ$ and size $S$ , and polynomially bounded, integral edge c…

cs.DM2023

Polytopes with Bounded Integral Slack Matrices Have Sub-Exponential Extension Complexity

Sally Dong, Thomas Rothvoss

We show that any bounded integral function $f : A \times B \mapsto {0, 1, \dots, Δ}$ with rank $r$ has deterministic communication complexity $Δ^{O(Δ)} \cdot \sqrt{r} \cdot \log r…