{"paper":{"title":"A Distributed $(2+\\epsilon)$-Approximation for Vertex Cover in $O(\\log{\\Delta}/\\epsilon\\log\\log{\\Delta})$ Rounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Gregory Schwartzman, Keren Censor-Hillel, Reuven Bar-Yehuda","submitted_at":"2016-02-11T13:00:04Z","abstract_excerpt":"We present a simple deterministic distributed $(2+\\epsilon)$-approximation algorithm for minimum weight vertex cover, which completes in $O(\\log{\\Delta}/\\epsilon\\log\\log{\\Delta})$ rounds, where $\\Delta$ is the maximum degree in the graph, for any $\\epsilon>0$ which is at most $O(1)$. For a constant $\\epsilon$, this implies a constant approximation in $O(\\log{\\Delta}/\\log\\log{\\Delta})$ rounds, which contradicts the lower bound of [KMW10]."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.03713","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}