✦ 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
DOI: 10.1007/s00224-010-9271-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Constant-time distributed dominating set

Constant-time distributed dominating set approximation

✍ Fabian Kuhn; Roger Wattenhofer 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 193 KB

Approximation Algorithms for Connected D

Approximation Algorithms for Connected Dominating Sets

✍ S. Guha; S. Khuller 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 140 KB

Approximation Algorithms for Connected D

Approximation Algorithms for Connected Dominating Sets

✍ S. Guha; S. Khuller 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 61 KB

A distributed algorithm for k-dominating

A distributed algorithm for k-dominating sets

✍ Lucia Draque Penso; Valmir Carneiro Barbosa 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 213 KB

A distributed algorithm to find k-domina

A distributed algorithm to find k-dominating sets

✍ Lucia D Penso; Valmir C Barbosa 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 222 KB

Fast Distributed Construction of Smallk-

Fast Distributed Construction of Smallk-Dominating Sets and Applications

✍ 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