Author:
Carmi Paz,Katz Matthew J.,Lev-Tov Nissan
Publisher
Springer Berlin Heidelberg
Reference9 articles.
1. Brönnimann, H., Goodrich, M.T.: Almost optimal set covers in finite VC-dimension. Discrete Computational Geometry 14, 463–479 (1995)
2. Calinescu, G., Mandoiu, I.I., Wan, P.-J., Zelikovsky, A.: Selecting forwarding neighbors in wireless ad hoc networks. MONET 9(2), 101–111 (2004)
3. Clarkson, K.L., Varadarajan, K.: Improved approximation algorithms for geometric set cover. In: Proc. 21st ACM Sympos. Computational Geometry, pp. 135–141 (2005)
4. Gonzalez, T.: Covering a set of points in multidimensional space. Information Processing Letters 40, 181–188 (1991)
5. Hochbaum, D.S., Maas, W.: Approximation schemes for covering and packing problems in image processing and VLSI. J. ACM 32, 130–136 (1985)
Cited by
30 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Worst-Case Optimal Covering of Rectangles by Disks;Discrete & Computational Geometry;2023-10-06
2. 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
3. Line segment disk cover;Discrete Applied Mathematics;2021-12
4. An exact algorithm for a class of geometric set-cover problems;Discrete Applied Mathematics;2021-09
5. Geometric Piercing Set Problem in Wireless Sensor Networks;Advanced Techniques for IoT Applications;2021-08-03