Constant Approximation for the Lifetime Scheduling Problem of <i>p</i>-Percent Coverage-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

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

Published:2022-09 Issue:5 Volume:34 Page:2675-2685
ISSN:1091-9856
Container-title:INFORMS Journal on Computing
language:en
Short-container-title:INFORMS Journal on Computing

Author:

Zhang Zhao¹^ORCID,Liang Wei¹^ORCID,Du Hongmin W.²,Liu Siwen³

Affiliation:

1. College of Mathematics and Computer Science, Zhejiang Normal University, 321004 Jinhua, Zhejiang, China;

2. Accounting and Information Systems Department, Rutgers Business School–Newark, Rutgers University, Newark, New Jersey 07102;

3. School of Management, Hefei University of Technology, 230009 Hefei, China

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.

Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Subject

General Engineering

Link

https://pubsonline.informs.org/doi/pdf/10.1287/ijoc.2022.1201

Reference30 articles.

1. Using Homogeneous Weights for Approximating the Partial Cover Problem

2. A 5+ϵ-approximation algorithm for minimum weighted dominating set in unit disk graph

3. Design and Analysis of Approximation Algorithms

4. Maximum lifetime connected coverage with two active-phase sensors

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP