Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph - researchr publication related

researchr

You are not signed in
Sign in
Sign up

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]

The following publications are possibly variants of this publication:

Almost-Polynomial Ratio ETH-Hardness of Approximating Densest $k$-SubgraphPasin Manurangsi. eccc, 23:195, 2016. [doi]

runs on WebDSL