On Sparsest Cut and Conductance in Directed Polymatroidal Networks

Chandra Chekuri, Anand Louis

We consider algorithms and spectral bounds for sparsest cut and conductance in directed polymatrodal networks. This is motivated by recent work on submodular hypergraphs \cite{Yosh…