2 citations · 4 across the 3 of their papers we have counts for
3 papers
cs.DS2019★ 2 cited
Flowless: Extracting Densest Subgraphs Without Flow Computations
Digvijay Boob, Yu Gao, Richard Peng +4
We propose a simple and computationally efficient method for dense subgraph discovery, which is a classic problem both in theory and in practice. It is well known that dense subgra…
math.OC2019★ 2 cited
Faster width-dependent algorithm for mixed packing and covering LPs
Digvijay Boob, Saurabh Sawlani, Di Wang
In this paper, we give a faster width-dependent algorithm for mixed packing-covering LPs. Mixed packing-covering LPs are fundamental to combinatorial optimization in computer scien…
cs.DS2019
Flows in Almost Linear Time via Adaptive Preconditioning
Rasmus Kyng, Richard Peng, Sushant Sachdeva +1
We present algorithms for solving a large class of flow and regression problems on unit weighted graphs to accuracy in almost-linear time. These problems includ…