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]
No references recorded for this publication.
No citations of this publication recorded.