Based on this, the sufficient and necessary condition under which a set of GD-Constrai NTS is a minimal cover is given.
在此基础上，给出了一个GD -约束集成为最小覆盖的充要条件。
Through the problem of lossy links inference is mapped to minimal set-cover problem, the algorithm based on heuristic strategy is proposed.
通过将失效链路推断问题映射为最小集合覆盖问题，提出了一种基于启发策略的失效链路推断算法。
Through the problem of lossy links inference is mapped to minimal set-cover problem, the algorithm based on heuristic strategy is proposed.
通过将失效链路推断问题映射为最小集合覆盖问题，提出了一种基于启发策略的失效链路推断算法。
应用推荐