Before revision:   UnitMaxQP, where A \in \{-1,0,1\}^{n\times n}, admits an (1/ 3d )-approximation in O(n ^{1.5 when the corresponding graph has no isolated vertices and at most dn edges. -
After revision:  MaxQP admits a (1/2\Delta)-approximation in O(n \lg n) time, where \Delta is the maximum degree of the corresponding graph. - UnitMaxQP, where A \in \{-1,0,1\}^{n\times n}, admits an (1/ 3d )-approximation in O(n ^{1.5 when the corresponding graph has no isolated vertices and at most dn edges. -