
[IEEE 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07) - Providence, RI, USA (2007.10.21-2007.10.23)] 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07) - Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence Constrained Scheduling
Ambuhl, Christoph, Mastrolilli, Monaldo, Svensson, OlaAnnée:
2007
Langue:
english
DOI:
10.1109/focs.2007.4389504
Fichier:
PDF, 363 KB
english, 2007