9.7k citations · 18.6k across the 63 of their papers we have counts for
Showing 2010 · cs.DSShow all
3 papers · 2 filters
cs.DS2010★ 24 cited
Vertex Sparsifiers: New Results from Old Techniques
Matthias Englert, Anupam Gupta, Robert Krauthgamer +3
Given a capacitated graph and a set of terminals , how should we produce a graph only on the terminals so that every (multicommodity) flow betwee…
cs.DS2010★ 30 cited
Lower Bounds on Near Neighbor Search via Metric Expansion
Rina Panigrahy, Kunal Talwar, Udi Wieder
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we look…
cs.DS2010★ 1 cited
Constrained Non-Monotone Submodular Maximization: Offline and Secretary Algorithms
Anupam Gupta, Aaron Roth, Grant Schoenebeck +1
Constrained submodular maximization problems have long been studied, with near-optimal results known under a variety of constraints when the submodular function is monotone. The ca…