We present a O(m√(τ)+nτ) time algorithm for finding a
minimum-cost flow ...
Many fundamental problems in machine learning can be formulated by the c...
We present a nearly-linear time algorithm for finding a minimum-cost flo...
Arising from structural graph theory, treewidth has become a focus of st...
Robust covariance estimation is the following, well-studied problem in h...