... 顶点覆盖 knotenueberdeckung vertex cover 顶点覆盖集 vertex cover set 网点覆盖率 dot area coverage ...
基于1个网页-相关网页
Firstly the constraints of weak vertex cover set are analyzed and the integer programming formulation for it is given.
首先分析了弱顶点覆盖集的约束关系，并给出了问题的整数规划形式。
Finally the approximation algorithm for the minimum weak vertex cover set is analyzed based on the maximal flow partition.
进一步分析了求解基于最大流划分的最小弱顶点覆盖集的近似算法。
应用推荐