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.