1. Arora, S., Berger, E., Hazan, E., Kindler, G., Safra, M.: On non-approximability for quadratic programs. In: FOCS 2005: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, pp. 206–215. IEEE Computer Society, Washington, DC (2005)
2. Alon, N., Naor, A.: Approximating the cut-norm via grothendieck’s inequality. SIAM J. Comput. 35, 787–803 (2006)
3. Austrin, P.: Towards sharp inapproximability for any 2-csp. In: Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, pp. 307–317. IEEE Computer Society, Washington, DC (2007)
4. Bhaskara, A., Charikar, M., Chlamtac, E., Feige, U., Vijayaraghavan, A.: Detecting high log-densities: an o(n
1/4) approximation for densest k-subgraph. In: STOC 2010: Proceedings of the 42nd ACM Symposium on Theory of Computing, pp. 201–210. ACM, New York (2010)
5. Bhaskara, A., Charikar, M., Manokaran, R., Vijayaraghavan, A.: On quadratic programming with a ratio objective. CoRR, abs/1101.1710 (2011)