Inapproximability results for sparsest cut, optimal linear arrangement, and precedence constrained scheduling (2007)

by C Ambühl, M Mastrolilli, O Svensson
Venue:Proc. of the 48th Annual IEEE Symposium on Foundations of Computer Science