On approximation algorithms for concave quadratic programming