We present a simple deterministic distributed (2+e) approximation algorithm for minimum weight vertex cover, which completes in  O (logδ/elog logδ) rounds, where δ is the maximum degree in the graph, for any e > 0 which is at most  O (1). For a constant e, this implies a constant approximation in  O logδ/log log δ) rounds, which contradicts the lower bound of [KMW10].
['Reuven Bar-Yehuda', 'Keren Censor-Hillel', 'Gregory Schwartzman']
A Distributed (2+ε)-Approximation for Vertex Cover in O(logδ/ε log log δ) Rounds