搜索结果: 1-4 共查到“Cover Problem”相关记录4条 . 查询时间(0.046 秒)
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars：A 1.344-approximation algorithm for the vertex cover problem
顶点覆盖问题 1.344 近似算法
2023/12/11
We present an algorithm for the vertex cover problem by combining the LP relaxation and the random edge-reductions. The algorithm has the expected approximation ratio of 1.344.
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars：Streaming algorithm for submodular cover problem
子模块化 覆盖问题 流算法
2023/5/15
In this work, we mainly investigate the problem that minimizes the price function such that the valuation function exceeds a required threshold in submodular cover problem, where the price function is...
We are given a set of weighted unit disks and a set of points in Eu-clidean plane. The minimum weight unit disk cover (WUDC) problem asks for a subset of disks of minimum total weight that covers all ...
Approximation Algorithms for the Connected Sensor Cover Problem
Approximation Algorithms Connected Sensor Cover Problem
2016/1/22
We study the minimum connected sensor cover problem(MIN-CSC) and the budgeted connected sensor cover (Budgeted-CSC)problem, both motivated by important applications in wireless sensor networks. In bot...