Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence Constrained Scheduling
Additional information
Authors
Ambuehl C.,
Mastrolilli M.,
Svensson O.
Type
Conference proceedings
Year
2007
Language
English
Series
In proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007)
