Author:
Ghosh Anirban,Hicks Brian,Shevchenko Ronald
Publisher
Springer International Publishing
Reference23 articles.
1. www.math.uwaterloo.ca/tsp/
2. Agarwal, P.K., Pan, J.: Near-linear algorithms for geometric hitting sets and set covers. In: Proceedings of the Thirtieth Annual Symposium on Computational Geometry, p. 271. ACM (2014)
3. Aloupis, G., Hearn, R.A., Iwasawa, H., Uehara, R.: Covering points with disjoint unit disks. In: CCCG, pp. 41–46 (2012)
4. Bar-Yehuda, R., Rawitz, D.: A note on multicovering with disks. Comput. Geom. 46(3), 394–399 (2013)
5. Biniaz, A., Liu, P., Maheshwari, A., Smid, M.: Approximation algorithms for the unit disk cover problem in 2D and 3D. Comput. Geom. 60, 8–18 (2017)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Bounded-Degree Plane Geometric Spanners in Practice;ACM Journal of Experimental Algorithmics;2023-04-08
2. Experiments with unit disk cover algorithms for covering massive pointsets;Computational Geometry;2023-02
3. Efficient approximation algorithms for offline and online unit disk multiple coverage;Computers and Electrical Engineering;2022-12
4. Minimalist Coverage and Energy-Aware Tour Planning for a Mobile Robot;2022 IEEE 18th International Conference on Automation Science and Engineering (CASE);2022-08-20
5. Fast Approximation Algorithms for Multiple Coverage with Unit Disks;2022 IEEE 23rd International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM);2022-06