Constant Approximation for the Lifetime Scheduling Problem of p-Percent Coverage
针对p百分比覆盖的寿命调度问题，本文给出了一个多项式时间的常数近似算法，解决了该领域的一个长期开放问题。
It has been an open question for some time whether there exists a polynomial-time constant approximation for the lifetime scheduling problem of p-percent coverage. In this paper, we give a positive answer to this question.