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

Zhao Zhang (), Wei Liang (), Hongmin W. Du () and Siwen Liu ()
Additional contact information
Zhao Zhang: College of Mathematics and Computer Science, Zhejiang Normal University, 321004 Jinhua, Zhejiang, China
Wei Liang: College of Mathematics and Computer Science, Zhejiang Normal University, 321004 Jinhua, Zhejiang, China
Hongmin W. Du: Accounting and Information Systems Department, Rutgers Business School–Newark, Rutgers University, Newark, New Jersey 07102
Siwen Liu: School of Management, Hefei University of Technology, 230009 Hefei, China

INFORMS Journal on Computing, 2022, vol. 34, issue 5, 2675-2685

Abstract: 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.

Keywords: lifetime scheduling; p -percent cover; constant approximation (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/ijoc.2022.1201 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:orijoc:v:34:y:2022:i:5:p:2675-2685

Access Statistics for this article

More articles in INFORMS Journal on Computing from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().