# Sequential vs Distributed algo question

If a certain graph problem in the $$\textbf{sequential}$$ setting is proven to have "no" better constant-factor approximation algorithm than say a 2-approx. algorithm in polynomial time, then does this also apply in the $$\textbf{distributed}$$ setting as an implication? Thanks