Set It and Forget It: Approximating the Set Once Strip Cover Problem-Reference-Cited by-同舟云学术

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

Set It and Forget It: Approximating the Set Once Strip Cover Problem

Published:2016-08-15 Issue:2 Volume:79 Page:368-386
ISSN:0178-4617
Container-title:Algorithmica
language:en
Short-container-title:Algorithmica

Author:

Bar-Noy Amotz,Baumer Ben,Rawitz Dror

Funder

Israel Science Foundation (IL)

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computer Science Applications,General Computer Science

Link

http://link.springer.com/article/10.1007/s00453-016-0198-8/fulltext.html

Reference22 articles.

1. Abrams, Z., Goel, A., Plotkin, S.A.: Set k-cover algorithms for energy efficient monitoring in wireless sensor networks. In: 3rd International Symposium on Information Processing in Sensor Networks, pp. 424–432 (2004)

2. Aloupis, G., Cardinal, J., Collette, S., Langerman, S., Orden, D., Ramos, P.: Decomposition of multiple coverings into more parts. Discrete Comput. Geom. 44(3), 706–723 (2010)

3. Bar-Noy, A., Baumer, B.: Average case network lifetime on an interval with adjustable sensing ranges. Algorithmica 72(1), 148–166 (2015)

4. Bar-Noy, A., Baumer, B., Rawitz, D.: Changing of the guards: strip cover with duty cycling. In: 19th International Colloquium onStructural Information and Communication Complexity, Volume 7355 of Lecture Notes in Computer Science, pp. 36–47 (2012)

5. Bar-Noy, A., Brown, T., Johnson, M.P., Liu, O.: Cheap or flexible sensor coverage. In: 5th IEEE International Conference on Distributed Computing in Sensor Systems, Volume 5516 of Lecture Notes in Computer Science, pp. 245–258 (2009)

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Sampling-Based Approach for Achieving Desired Patterns of Probabilistic Coverage with Distributed Sensor Networks;Sensors;2023-06-28

2. Maximizing barrier coverage lifetime with static sensors;Journal of Scheduling;2022-05-23

3. “Green” barrier coverage with mobile sensors;Theoretical Computer Science;2021-03

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3