Which is the approximation class of Minimum 0-1 integer programming if only non-negative integers are allowed?
Kolloiopoulos and Young give an $O(\log m)$ approximation for general covering integer programs. See the paper below.
http://www.sciencedirect.com/science/article/pii/S0022000005000656