Before revision:  We give polynomial-time\vec{c} constant-factor  approximation algorithms for both problems, which use standard sparsification as well as iterative rounding techniques for LP relaxations .
After revision:  We give polynomial-time\vec{c} constant-factor approximation algorithms for both problems, based on several novel techniques in LP rounding .