Join Our Newsletter

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

SPAA

2010

ACM

2010

ACM

We present a distributed algorithm that ﬁnds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes in the network; here ∆ is the maximum degree of the graph and W is the maximum weight. As a direct application, we have a distributed 2-approximation algorithm for minimum-weight vertex cover, with the same running time. We also show how to ﬁnd an f-approximation of minimumweight set cover in O(f2 k2 + fk log∗ W) rounds; here k is the maximum size of a subset in the set cover instance, f is the maximum frequency of an element, and W is the maximum weight of a subset. The algorithms are deterministic, and they can be applied in anonymous networks. Categories and Subject Descriptors C.2.4 [Computer-Communication Networks]: Distributed Systems; F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems—computations on discrete structures General Terms Algorithms, Theory

Related Content

Added |
18 Jul 2010 |

Updated |
18 Jul 2010 |

Type |
Conference |

Year |
2010 |

Where |
SPAA |

Authors |
Matti Åstrand, Jukka Suomela |

Comments (0)