Towards strong nonapproximability results in the Lovasz-Schrijver hierarchy

Mikhail Alecknovich, Sanjeev Arora, Iannis Tourlakis. Towards strong nonapproximability results in the Lovasz-Schrijver hierarchy. Electronic Colloquium on Computational Complexity (ECCC), (117), 2004. [doi]

Authors

Mikhail Alecknovich

This author has not been identified. Look up 'Mikhail Alecknovich' in Google

Sanjeev Arora

This author has not been identified. Look up 'Sanjeev Arora' in Google

Iannis Tourlakis

This author has not been identified. Look up 'Iannis Tourlakis' in Google