Sciweavers

Share
SPAA   2010 ACM Symposium on Parallel Algorithms and Architectures
Wall of Fame | Most Viewed SPAA-2010 Paper
SPAA
2010
ACM
9 years 1 months ago
Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
Matti Åstrand, Jukka Suomela
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
IdReadViewsTitleStatus
1Download preprint from source282
2Download preprint from source206
3Download preprint from source198
4Download preprint from source196
5Download preprint from source195
6Download preprint from source191
7Download preprint from source179
8Download preprint from source174
9Download preprint from source174
10Download preprint from source171
11Download preprint from source168
12Download preprint from source162
13Download preprint from source161
14Download preprint from source153
15Download preprint from source152
16Download preprint from source141
17Download preprint from source137
18Download preprint from source133
19Download preprint from source133
20Download preprint from source132
21Download preprint from source129
22Download preprint from source128
23Download preprint from source124
24Download preprint from source122
25Download preprint from source122
26Download preprint from source120
27Download preprint from source119
28Download preprint from source116
29Download preprint from source113
30Download preprint from source112
31Download preprint from source109
32Download preprint from source102
33Download preprint from source102
books