Loading...
conference paper
Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence Constrained Scheduling
2007
48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), October 20-23, 2007, Providence, RI, USA, Proceedings
Type
conference paper
Authors
Publication date
2007
Publisher
Published in
48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), October 20-23, 2007, Providence, RI, USA, Proceedings
ISBN of the book
978-0-7695-3010-9
Start page
329
End page
337
Peer reviewed
REVIEWED
EPFL units
Available on Infoscience
May 10, 2017
Use this identifier to reference this record