Work

Towards strong nonapproximability results in the Lovasz-Schrijver hierarchy

Year: 2004

Type: preprint

Source: Electronic colloquium on computational complexity

Authors: Mikhail Alecknovich, Sanjeev Arora, Iannis Tourlakis

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W338417986

Cites:

Cited by:

Related to: 10