| Article Details | ||
|---|---|---|
| Title: | Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph | |
| Article URLs: | ||
| Alternative Article URLs: | ||
| Authors: | Pasin Manurangsi |
|
| Sharing: | Unknown | |
| Verification: | Author has not verified information | |
| Artifact Evaluation Badge: | none | |
| Artifact URLs: |
|
|
| Artifact Correspondence Email Addresses: |
|
|
| NSF Award Numbers: | 1540685, 1655215 | |
| DBLP Key: | conf/stoc/Manurangsi17 | |
| Author Comments: | ||