On the Non-Uniform Sparsest Cut Problem on Bounded Treewidth Graphs
and David W
Metric embedding via shortest path decompositions