# Reference request for finding minimum cost connected dominating set

I know that finding a connected dominating set has a $$O(logn)$$ factor, I'm seeking a reference that achieves this ratio by giving an LP and rounding it (preferably randomized rounding).