WDAG   2010 International Workshop on Distributed Algorithms
Wall of Fame | Most Viewed WDAG-2010 Paper
233views Algorithms» more  WDAG 2010»
13 years 4 months ago
Minimum Dominating Set Approximation in Graphs of Bounded Arboricity
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
Christoph Lenzen, Roger Wattenhofer
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.
1Download preprint from source233
2Download preprint from source230
3Download preprint from source218
4Download preprint from source216
5Download preprint from source206
6Download preprint from source204
7Download preprint from source199
8Download preprint from source196
9Download preprint from source191
10Download preprint from source185
11Download preprint from source185
12Download preprint from source184
13Download preprint from source183
14Download preprint from source182
15Download preprint from source178
16Download preprint from source177
17Download preprint from source168
18Download preprint from source168
19Download preprint from source164
20Download preprint from source158