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 .
After revision:  The previous best O(\alpha)-approximation algorithms are LP-based and have super-linear running time. 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 .