The minimum capacitated dominating set problem is an NP-hard variant of the well-known minimum dominating set problem in undirected graphs. This problem finds applications in the context of clustering and routing in wireless networks. Two algorithms are presented in this work. https://www.ealisboa.com/top-offer-Birkenstock-Arizona-Eva-Beetroot-Purple-best-save/