Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph
- Award ID(s):
- 1655215
- PAR ID:
- 10041974
- Date Published:
- Journal Name:
- Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing
- Page Range / eLocation ID:
- 954 to 961
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
No document suggestions found
An official website of the United States government

