Approximation algorithms for the unit disk cover problem in 2D and 3D-Reference-Cited by-同舟云学术

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

Approximation algorithms for the unit disk cover problem in 2D and 3D

Published:2017-01 Issue: Volume:60 Page:8-18
ISSN:0925-7721
Container-title:Computational Geometry
language:en
Short-container-title:Computational Geometry

Author:

Biniaz Ahmad,Liu Paul,Maheshwari Anil,Smid Michiel

Funder

NSERC

Publisher

Elsevier BV

Subject

Computational Mathematics,Computational Theory and Mathematics,Control and Optimization,Geometry and Topology,Computer Science Applications

Reference13 articles.

1. Unit disk cover problem in 2D;Acharyya,2013

2. Decomposable searching problems. I. Static-to-dynamic transformation;Bentley;J. Algorithms,1980

3. Almost optimal set covers in finite VC-dimension;Brönnimann;Discrete Comput. Geom.,1995

4. Optimal partition trees;Chan;Discrete Comput. Geom.,2012

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

1. A new heuristic for the continuous fixed-radius disc cover problem;Engineering Optimization;2024-07-22

2. Experiments with unit disk cover algorithms for covering massive pointsets;Computational Geometry;2023-02

3. Covering a Set of Points with a Minimum Number of Equal Disks via Simulated Annealing;Numerical Methods and Applications;2023

4. Efficient approximation algorithms for offline and online unit disk multiple coverage;Computers and Electrical Engineering;2022-12

5. Finding the minimum number of disks of fixed radius needed to cover a set of points in the plane by MaxiMinMax approach;2022 International Conference Automatics and Informatics (ICAI);2022-10-06

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP