arXiv 0810.21752008-10-13cs.DC

A simple local 3-approximation algorithm for vertex cover

Valentin Polishchuk, Jukka Suomela

备注：: 6 pages, 1 figure
发表信息：: Information Processing Letters 109 (2009) 642-645
DOI：: 10.1016/j.ipl.2009.02.017

英文摘要：

We present a local algorithm (constant-time distributed algorithm) for finding a 3-approximate vertex cover in bounded-degree graphs. The algorithm is deterministic, and no auxiliary information besides port numbering is required.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Parallel Vertex Cover Algorithms on GPUs

Finding small vertex covers in a graph has applications in numerous domains. Two common formulations of the problem include: Minimum Vertex Cover, which finds the smallest vertex cover in a graph, and Parameterized Vertex Cover, which finds a vertex cover whose size is less than or equal to some parameter $k$. Algorithms for both formulations traverse a search tree, which grows exponentially with the size of the graph or the value of $k$. Parallelizing the traversal of the vertex cover search tree on GPUs is challenging for multiple reasons. First, the search tree is a narrow binary tree which…

2022-04-21cs.DC

A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Cover

The paper describes a simple deterministic parallel/distributed (2+epsilon)-approximation algorithm for the minimum-weight vertex-cover problem and its dual (edge/element packing).

2002-05-18cs.DCcs.DS

Distributed Vertex Cover Algorithms For Wireless Sensor Networks

Vertex covering has important applications for wireless sensor networks such as monitoring link failures, facility location, clustering, and data aggregation. In this study, we designed three algorithms for constructing vertex cover in wireless sensor networks. The first algorithm, which is an adaption of the Parnas & Ron's algorithm, is a greedy approach that finds a vertex cover by using the degrees of the nodes. The second algorithm finds a vertex cover from graph matching where Hoepman's weighted matching algorithm is used. The third algorithm firstly forms a breadth-first search tree and …

2014-02-10cs.DCcs.NI

A Parallel Genetic Algorithm for Generalized Vertex Cover Problem

This paper presents a parallel genetic algorithm for generalised vertex cover problem (GVCP) using Hadoop Map-Reduce framework. The proposed Map-Reduce implementation helps to run the genetic algorithm for generalized vertex cover problem (GVCP) on multiple machines parallely and computes the solution in relatively short time.

2014-11-27cs.DCcs.NE

A Massively Parallel Algorithm for Minimum Weight Vertex Cover

We present a massively parallel algorithm, with near-linear memory per machine, that computes a $(2+\varepsilon)$-approximation of minimum-weight vertex cover in $O(\log\log d)$ rounds, where $d$ is the average degree of the input graph. Our result fills the key remaining gap in the state-of-the-art MPC algorithms for vertex cover and matching problems; two classic optimization problems, which are duals of each other. Concretely, a recent line of work---by Czumaj et al. [STOC'18], Ghaffari et al. [PODC'18], Assadi et al. [SODA'19], and Gamlath et al. [PODC'19]---provides $O(\log\log n)$ time a…

2020-05-21cs.DCcs.DS

Approximate Bipartite Vertex Cover in the CONGEST Model

We give efficient distributed algorithms for the minimum vertex cover problem in bipartite graphs in the CONGEST model. From Kőnig's theorem, it is well known that in bipartite graphs the size of a minimum vertex cover is equal to the size of a maximum matching. We first show that together with an existing $O(n\log n)$-round algorithm for computing a maximum matching, the constructive proof of Kőnig's theorem directly leads to a deterministic $O(n\log n)$-round CONGEST algorithm for computing a minimum vertex cover. We then show that by adapting the construction, we can also convert an \emph{a…

2020-11-19cs.DCcs.DS

更多相关论文收起更多论文

A Distributed $(2+ε)$-Approximation for Vertex Cover in $O(\logΔ/ε\log\logΔ)$ Rounds

We present a simple deterministic distributed $(2+ε)$-approximation algorithm for minimum weight vertex cover, which completes in $O(\logΔ/ε\log\logΔ)$ rounds, where $Δ$ is the maximum degree in the graph, for any $ε>0$ which is at most $O(1)$. For a constant $ε$, this implies a constant approximation in $O(\logΔ/\log\logΔ)$ rounds, which contradicts the lower bound of [KMW10].

2016-02-12cs.DCcs.DS

Simple Round Compression for Parallel Vertex Cover

Recently, Czumaj et.al. (arXiv 2017) presented a parallel (almost) $2$-approximation algorithm for the maximum matching problem in only $O({(\log\log{n})^2})$ rounds of the massive parallel computation (MPC) framework, when the memory per machine is $O(n)$. The main approach in their work is a way of compressing $O(\log{n})$ rounds of a distributed algorithm for maximum matching into only $O({(\log\log{n})^2})$ MPC rounds. In this note, we present a similar algorithm for the closely related problem of approximating the minimum vertex cover in the MPC framework. We show that one can achieve an …

2017-09-14cs.DCcs.DS

A Deterministic Distributed $2$-Approximation for Weighted Vertex Cover in $O(\log n\logΔ/ \log^2\logΔ)$ Rounds

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 Δ/ \log^2 \log Δ)$. This improves over the currently best known deterministic 2-approximation implied by [KVY94]. Our solution generalizes the $(2+ε)$-approximation algorithm of [BCS17], improving the dependency on $ε^{-1}$ from linear to logarithmic. In addition, for every $ε=(\log Δ)^{-c}$, where $c\geq 1$ is a constant, our algorithm computes a $(2+ε)$-approximation in $O(\log Δ/ \log \log Δ)$~rounds (which is asymptotic…

2018-05-23cs.DCcs.DS