Join Our Newsletter

Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Pinyin
i2Cantonese
i2Cangjie
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

PODC

2009

ACM

2009

ACM

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...

Related Content

Added |
25 Nov 2009 |

Updated |
25 Nov 2009 |

Type |
Conference |

Year |
2009 |

Where |
PODC |

Authors |
Christos Koufogiannakis, Neal E. Young |

Comments (0)