Christoph Ambühl Monaldo Mastrolilli Ola Svensson Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence Constrained Scheduling. 329-337 2007 FOCS http://doi.ieeecomputersociety.org/10.1109/FOCS.2007.32 conf/focs/2007 db/conf/focs/focs2007.html#AmbuhlMS07