Before revision:  We are interested in the case when G is a line graph of a tree, proving that the problem is NP-hard and obtaining a polynomial-time additive 2b-approximation algorithm.
After revision:  We are interested in the case when G is a line graph of a tree, proving that the problem is NP-hard and obtaining a polynomial-time additive b-approximation algorithm.