Although finding the Minimum Connected Dominating Set (MCDS) in an arbitrary graph is a NP-bard problem, many approximation algorithms have been proposed to construct a serviceable CDS.

• 由于求解最小连通支配集是一个NP难问题，许多近似算法被提出用于构建可用的最小连通支配集。