Publication
Video
Twice-Ramanujan Sparsifiers
We prove that every graph has a spectral sparsifier with a number of edges linear in its number of vertices. As linear-sized spectral sparsifiers of complete graphs are expanders, our sparsifiers of arbitrary graphs can…
Publication
Price of Anarchy for Greedy Auctions
Publication
Survivable Virtual Network Embedding
Publication