Constant Approximation for the Lifetime Scheduling Problem of p-Percent Coverage

摘要

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.

关键词