Pasin Manurangsi. Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph. In Hamed Hatami, Pierre McKenzie, Valerie King, editors, Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19-23, 2017. pages 954-961, ACM, 2017. [doi]
@inproceedings{Manurangsi17,
title = {Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph},
author = {Pasin Manurangsi},
year = {2017},
doi = {10.1145/3055399.3055412},
url = {http://doi.acm.org/10.1145/3055399.3055412},
researchr = {https://researchr.org/publication/Manurangsi17},
cites = {0},
citedby = {0},
pages = {954-961},
booktitle = {Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19-23, 2017},
editor = {Hamed Hatami and Pierre McKenzie and Valerie King},
publisher = {ACM},
isbn = {978-1-4503-4528-6},
}