Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph (Q4978037)
From MaRDI portal
scientific article; zbMATH DE number 6761869
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph |
scientific article; zbMATH DE number 6761869 |
Statements
Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph (English)
0 references
17 August 2017
0 references
densest \(k\)-subgraph
0 references
hardness of approximation
0 references
