93 citations · 537 across the 73 of their papers we have counts for
5 papers · 1 filter
Iterative Row Sampling
Mu Li, Gary L. Miller, Richard Peng
There has been significant interest and progress recently in algorithms that solve regression problems involving tall and thin matrices in input sparsity time. These algorithms fin…
Approximate Maximum Flow on Separable Undirected Graphs
Gary Miller, Richard Peng
We present faster algorithms for approximate maximum flow in undirected graphs with good separator structures, such as bounded genus, minor free, and geometric graphs. Given such a…
Faster spectral sparsification and numerical algorithms for SDD matrices
Ioannis Koutis, Alex Levin, Richard Peng
We study algorithms for spectral graph sparsification. The input is a graph with vertices and edges, and the output is a sparse graph that approximates …
Faster Approximate Multicommodity Flow Using Quadratically Coupled Flows
Jonathan A. Kelner, Gary Miller, Richard Peng
The maximum multicommodity flow problem is a natural generalization of the maximum flow problem to route multiple distinct flows. Obtaining a approximation to the multicommod…
Faster and Simpler Width-Independent Parallel Algorithms for Positive Semidefinite Programming
Richard Peng, Kanat Tangwongsan, Peng Zhang
This paper studies the problem of finding an -approximate solution to positive semidefinite programs. These are semidefinite programs in which all matrices in the constraint…