Sparsest cut on bounded treewidth graphs: algorithms and hardness results (2013)

by A Gupta, K Talwar, D Witmer
Venue:In proceedings of STOC