Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut (Q3020016)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut |
scientific article |
Statements
Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut (English)
0 references
29 July 2011
0 references
hardness of approximation
0 references
graph theory
0 references
maximum edge biclique problem
0 references
minimum linear arrangement problem
0 references
sparsest cut problem
0 references
NP-hardness
0 references
