1 citations · 1 across the 1 of their papers we have counts for
1 paper
T-H. Hubert Chan, Bintao Sun
We give approximation algorithms for the edge expansion and sparsest cut with product demands problems on directed hypergraphs, which subsume previous graph models such as undirect…