Before revision:   2. Based on our centralized algorithm, we design a distributed combinatorial O(\alpha)-approximation algorithm in the \mathsf{CONGEST} model that runs in O(\alpha\log n) rounds with high probability . Our round complexity outperforms the best LP-based distributed algorithm for a wide range of parameters .
After revision:  2. Based on our centralized algorithm, we design a distributed combinatorial O(\alpha)-approximation algorithm in the \mathsf{CONGEST} model that runs in O(\alpha\log n) rounds with high probability .