Randomized algorithms for the set cover problem and its variations and duals.
集合覆盖问题的各种变体以及其对偶问题的随机算法研究。
This is the Weighted Set Cover problem.
问题就成为了带有权重的集合覆盖问题。
This thesis proposes a randomized approximation algorithm for the Set Cover problem.
提出了集合覆盖问题的一种随机近似算法。
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.
通过将失效链路推断问题映射为最小集合覆盖问题，提出了一种基于启发策略的失效链路推断算法。
应用推荐