检索结果-内蒙古大学图书馆

Approximation algorithm for distance constraint sweep coverage without predetermined base stations

DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS 2018年第5期10卷

作者： Chen, Qingqing Huang, Xiaohui Ran, Yingli Zhejiang Normal Univ Coll Math Phys & Informat Engn Jinhua 321004 Zhejiang Peoples R China

In a sweep-coverage problem, each point of interest should be visited at least once by some mobile sensor every required time interval. Because of energy constraint, each mobile sensor has to visit a base station for replenishment before running out of its power. We model the problem as a distance constraint sweep-coverage problem the goal of which is to minimize the sum of the number of mobile sensors and the number of base stations used to meet the requirements. This paper presents an approximation algorithm with a guaranteed approximation ratio 7.

关键词： sweep-coverage distance constraint approximation algorithm

来源：评论

学校读者我要写书评

暂无评论

Approximation algorithm for prize-collecting sweep cover with base stations

引用

THEORETICAL COMPUTER SCIENCE 2022年 929卷 1-10页

作者： Liang, Wei Zhang, Zhao Zhejiang Normal Univ Coll Math & Comp Sci Jinhua 321004 Zhejiang Peoples R China

In a sweep cover problem, positions of interest (PoIs) are required to be visited periodically by mobile sensors. In this paper, we propose a new sweep cover problem: the prize -collecting sweep cover problem (PCSC), in which penalty is incurred by those PoIs which are not sweep-covered, and the goal is to minimize the covering cost plus the penalty. Assuming that every mobile sensor has to be linked to some base station, and the number of base stations is upper bounded by a constant, we present a 5-LMP (Lagrangian Multiplier Preserving) algorithm. As a step stone, we propose the prize-collecting forest with k components problem (PCFk), which might be interesting in its own sense, and presented a 2-LMP for rooted PCFk. (C) 2022 Elsevier B.V. All rights reserved.

关键词： sweep-coverage Prize-collecting Approximation algorithm

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：