Vertex Sparsification and Universal Rounding Algorithms by Ankur Moitra


Suppose we are given a gigantic communication network, but are only interested in a small number of nodes (clients). There are many routing problems we could be asked to solve for our clients. Is there a much smaller network that we could write down on a sheet of paper and put in our pocket that approximately preserves all the relevant communication… (More)


  • Presentations referencing similar topics