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.diegojavierfares.com/mega-price-Houston-Texans-NFL-Side-Stripe-Training-Shorts-p6850-top-buy/