In this paper , Minimum Exact Cover Problem ( MECP ) for key distribution is presented , and a heuristic solution is testified .
本文提出组密钥分发的最小准确覆盖问题，并证明一种启发式的解。
MECP