Approximating optimum branchings in linear time

We prove that maximum weight branchings in directed graphs can be approximated in time O(m) up to a factor of 1−ε, where ε>0 is an arbitrary constant.