Approximating Sparse Quadratic Programs

Cited by: 0|Views22

Abstract:

Given a matrix $A \in \mathbb{R}^{n\times n}$, we consider the problem of maximizing $x^TAx$ subject to the constraint $x \in \{-1,1\}^n$. This problem, called MaxQP by Charikar and Wirth [FOCS'04], generalizes MaxCut and has natural applications in data clustering and in the study of disordered magnetic phases of matter. Charikar and W...More

Code:

Data:

Full Text
Bibtex
Your rating :
0

 

Tags
Comments