3 citations · 3 across the 2 of their papers we have counts for
2 papers
cs.DS2022
Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time
Sally Dong, Yu Gao, Gramoz Goranci +4
We present a nearly-linear time algorithm for finding a minimum-cost flow in planar graphs with polynomially bounded integer costs and capacities. The previous fastest algorithm fo…
cs.DS2020★ 3 cited
Robust Gaussian Covariance Estimation in Nearly-Matrix Multiplication Time
Jerry Li, Guanghao Ye
Robust covariance estimation is the following, well-studied problem in high dimensional statistics: given samples from a -dimensional Gaussian $\mathcal{N}(\boldsymbol{0}, Σ…