165 citations · 950 across the 71 of their papers we have counts for
Showing 2010 · cs.DSShow all
2 papers · 2 filters
cs.DS2010★ 1 cited
Pareto Optimal Solutions for Smoothed Analysts
Ankur Moitra, Ryan O'Donnell
Consider an optimization problem with binary variables and linear objective functions. Each valid solution gives rise to an objective vector in $\R^{d+1…
cs.DS2010
Vertex Sparsifiers and Abstract Rounding Algorithms
Moses Charikar, Tom Leighton, Shi Li +1
The notion of vertex sparsification is introduced in \cite{M}, where it was shown that for any graph and a subset of terminals , there is a polynomial…