Distributed and parallel algorithms for weighted vertex cover and other covering problems

The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example, = 2 for vertex cover). Specific results include the following. ? For weighted vertex cover, the first distributed 2-approximation algorithm taking O(log n) rounds and the first parallel 2-approximation algorithm in RNC. The algorithms generalize to covering mixed integer linear programs (CMIP) with two variables per constraint ( = 2). ? For any covering problem with monotone constraints and submodular cost, a distributed -approximation algorithm taking O(log2 |C|) rounds, where |C| is the number of constraints. (Special cases include CMIP, facility location, and probabilistic (two-stage) variants of these problems.) Categories and Subject Descriptors G.2.2 [DISCRETE MATHEMATICS]: Graph Theory-Graph algorithms, Hypergraphs; F.2.2 [ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY]: Nonnumerical Algorithms and P...

• Type: Conference
• Year: 2009
• Where: PODC
• Authors: Christos Koufogiannakis, Neal E. Young
• Keywords: ALGORITHMS AND PROBLEM, Distributed -approximation Algorithm, Parallel -approximation Algorithms, Parallel Computing, PODC 2009