Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph (Q4978037)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph |
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
0.9173733
0 references
0.90968144
0 references
0.90512955
0 references
0.9003662
0 references
0.89507854
0 references
0 references
0 references
0.8856733
0 references
0.88486314
0 references
0 references
