What cannot be computed locally!

We give time lower bounds for the distributed approximation of minimum vertex cover (MVC) and related problems such as minimum dominating set (MDS). In <i>k</i> communication rounds, MVC and MDS can only be approximated by factors Ω(<i>n</i><sup><i>c/k</i>2</sup>/<i>k</i>) and Ω(Δ><sup><i>1/k</i></sup>/<i>k</i>) for some constant <i>c</i>, where <i>n</i… CONTINUE READING

3 Figures & Tables



Citations per Year

305 Citations

Semantic Scholar estimates that this publication has 305 citations based on the available data.

See our FAQ for additional information.