Inapproximability results for maximum edge biclique, minimum linear arrangement, and sparsest cut (0)

by C Ambühl, M Mastrolilli, O Svensson
Venue:SIAM Journal of Computing