Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut

Christoph Ambühl, Monaldo Mastrolilli, Ola Svensson. Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut. SIAM Journal on Computing, 40(2):567-596, 2011. [doi]

Abstract

Abstract is missing.