We study the relationship between the computationally defined class NCX of all optimization problems that are approximable within constant ratio in NC and syntactically defined classes MAXSNP and MAXNP. A simple observation shows that any problem in MAXSNP is constant approximable in NC. We show that MAXNP is also contained in NCX.