Randomized algorithms for the set cover problem and its variations and duals.
集合覆盖问题的各种变体以及其对偶问题的随机算法研究。
Aim To solve the induced matching cover problem of some graphs, such as the product of two paths and the nontrivial tree.
目的解决某些图类的导出匹配覆盖问题，特别是两条路的乘积图和非平凡树。
Through the problem of lossy links inference is mapped to minimal set-cover problem, the algorithm based on heuristic strategy is proposed.
通过将失效链路推断问题映射为最小集合覆盖问题，提出了一种基于启发策略的失效链路推断算法。
This thesis proposes a randomized approximation algorithm for the Set Cover problem.
提出了集合覆盖问题的一种随机近似算法。
An algorithm resolving Matrix Cover problem rapidly is introduced and extended. The domain for the components of vectors is enlarged.
介绍一种快速求解矩阵覆盖问题的算法，并对此算法进行了扩展，将原算法中向量的各个分量的取值范围扩大。
An algorithm resolving Matrix Cover problem rapidly is introduced and extended. The domain for the components of vectors is enlarged.
介绍一种快速求解矩阵覆盖问题的算法，并对此算法进行了扩展，将原算法中向量的各个分量的取值范围扩大。
应用推荐