Then, a matching of maximum cardinality of G corresponds to an optimal movement plan which maximizes the network coverage subject to minimizing the movement costs.

• 对构造的二部图G求它的最小花费的最大匹配基，则该匹配基对应着一个最优的移动方案，按此方案部署的网络覆盖率最大且总的移动花费最小。