{"paper":{"title":"A Deterministic Distributed $2$-Approximation for Weighted Vertex Cover in $O(\\log n\\log\\Delta / \\log^2\\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, Guy Even, Ken-ichi Kawarabayashi, Ran Ben-Basat","submitted_at":"2018-04-04T09:01:44Z","abstract_excerpt":"We present a deterministic distributed $2$-approximation algorithm for the Minimum Weight Vertex Cover problem in the CONGEST model whose round complexity is $O(\\log n \\log \\Delta / \\log^2 \\log \\Delta)$. This improves over the currently best known deterministic 2-approximation implied by [KVY94]. Our solution generalizes the $(2+\\epsilon)$-approximation algorithm of [BCS17], improving the dependency on $\\epsilon^{-1}$ from linear to logarithmic. In addition, for every $\\epsilon=(\\log \\Delta)^{-c}$, where $c\\geq 1$ is a constant, our algorithm computes a $(2+\\epsilon)$-approximation in $O(\\log "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.01308","kind":"arxiv","version":3},"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"}