Ruling Out PTAS for Graph Min‐Bisection, Dense k‐Subgraph, and Bipartite Clique (Q5757457)
From MaRDI portal
scientific article; zbMATH DE number 5188163
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Ruling Out PTAS for Graph Min‐Bisection, Dense k‐Subgraph, and Bipartite Clique |
scientific article; zbMATH DE number 5188163 |
Statements
Ruling Out PTAS for Graph Min‐Bisection, Dense k‐Subgraph, and Bipartite Clique (English)
0 references
7 September 2007
0 references
probabilistically checkable proofs
0 references
hardness of approximation
0 references
approximation algorithms
0 references
