Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence Constrained Scheduling
2007
Details
Title
Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence Constrained Scheduling
Author(s)
Ambühl, Christoph ; Mastrolilli, Monaldo ; Svensson, Ola
Published in
48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), October 20-23, 2007, Providence, RI, USA, Proceedings
Pages
329-337
Date
2007
Publisher
IEEE Computer Society
ISBN
978-0-7695-3010-9
Laboratories
THL2
Record Appears in
Scientific production and competences > I&C - School of Computer and Communication Sciences > IINFCOM > THL2 - Theory of Computation Laboratory 2
Peer-reviewed publications
Work outside EPFL
Conference Papers
Published
Peer-reviewed publications
Work outside EPFL
Conference Papers
Published
Record creation date
2017-05-10