| 1. | Combinational analysis for a class of set covering problem
一类覆盖问题的组合学分析 |
| 2. | Randomized approximation algorithm for weighted set cover problem
带权集合覆盖问题的一种随机近似算法 |
| 3. | On cycle double cover problems
双圈覆盖问题 |
| 4. | Given that data users should first be voice users , the coverage issue is resolved . ii
而数据业务用户一般首先是语音业务用户，网络覆盖问题得到了解决。 |
| 5. | Operators feel that the network coverage of the service area is key to successful service rollouts
运营商感到，网络对业务服务区域内覆盖问题是影响网络业务开展的关键因素。 |
| 6. | This paper presents a fully localized algorithm to solve the worst coverage problem first introduced by meguerdichian
Meguerdichian最先定义了最坏覆盖问题，并提出了基于计算几何的集中式算法解决该问题。 |
| 7. | Moreover , this algorithm can be easily extended to solve the minimal exposure problem with local information as well
本文是首次提出了完全局部化的算法来解决最坏覆盖问题，并对算法的正确性给出了形式化证明。 |
| 8. | In this thesis , a polynomial function of exact cover to area minimization was given , and one case , k 3 , is discussed
本论文利用最小顶点覆盖问题规约到面积优化问题,只需讨论k 3一种情况,证明过程很简略。 |
| 9. | If a single - frequency network is used to provide gprs service , the concern is the issue of coverage and in particular continuous coverage in urban areas
由单频网提供gprs业务，首先是覆盖问题，特别是市区的连续覆盖。 |
| 10. | A variation of one - dimensional bin packing problem : the minimum cardinality bin covering problem is described and it is a huristic algorithm is designed
摘要文章介绍一维装箱问题的一个衍生问题：最小基数箱子覆盖问题和它的一个启发式算法。 |
