๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Distributed Approximation of Capacitated Dominating Sets

โœ Scribed by Fabian Kuhn; Thomas Moscibroda


Publisher
Springer
Year
2010
Tongue
English
Weight
596 KB
Volume
47
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Fast Distributed Construction of Smallk-
โœ Shay Kutten; David Peleg ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 312 KB

This article presents a fast distributed algorithm to compute a small k-dominat-ลฝ . ลฝ ing set D for any fixed k and to compute its induced graph partition breaking . the graph into radius k clusters centered around the vertices of D . The time ลฝ . complexity of the algorithm is O k log\* n . Small k