On non-approximability for quadratic programs

@article{Arora2005OnNF,
  title={On non-approximability for quadratic programs},
  author={Sanjeev Arora and Eli Berger and Elad Hazan and Guy Kindler and Shmuel Safra},
  journal={46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05)},
  year={2005},
  pages={206-215}
}
This paper studies the computational complexity of the following type of quadratic programs: given an arbitrary matrix whose diagonal elements are zero, find x /spl isin/ {-1, 1}/sup n/ that maximizes x/sup T/Mx. This problem recently attracted attention due to its application in various clustering settings, as well as an intriguing connection to the famous Grothendieck inequality. It is approximable to within a factor of O(log n), and known to be NP-hard to approximate within any factor better… CONTINUE READING
Highly Cited
This paper has 50 citations. REVIEW CITATIONS

References

Publications referenced by this paper.
Showing 1-10 of 20 references

O’Donnell

  • R S. Khot
  • personal communications, march
  • 2005
Highly Influential
4 Excerpts

personal communications

  • Subhash Khot
  • MARCH
  • 2005
Highly Influential
5 Excerpts

integrality gap for cut problems and embeddability of negative type metrics into `1

  • S. Khot, N. Vishnoi. The unique games conjecture
  • to appear FOCS
  • 2005
3 Excerpts

and Ryan ODonnell

  • Subhash Khot, Guy Kindler, Elchanan Mossel
  • Optimal inapproximability results for max-cut and…
  • 2004
5 Excerpts

On the gram matrices of systems of uniformly bounded functions

  • B. S. Kashin, S. J. Szarek
  • Proceedings of the Steklov Institute of…
  • 2003
2 Excerpts

Spin Glasses: a Challenge to Mathematicians

  • Michel Talagrand
  • volume 46 of Ergbnisse der Mathematik und ihrer…
  • 2003
1 Excerpt

Similar Papers

Loading similar papers…