This site uses cookies for analytics, personalized content and ads. By continuing to browse this site, you agree to this use. Learn more
We give time lower bounds for the distributed approximation of minimum vertex cover (MVC) and related problems such as minimum dominating set (MDS). See attachment for full abstract.
