Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence Constrained Scheduling.

Christoph Ambhl, Monaldo Mastrolilli, Ola Svensson

Browse the full FOCS paper archive.