Covering a set of points in multidimensional space-Reference-Cited by-同舟云学术

Covering a set of points in multidimensional space

Published:1991-11 Issue:4 Volume:40 Page:181-188
ISSN:0020-0190
Container-title:Information Processing Letters
language:en
Short-container-title:Information Processing Letters

Author:

Gonzalez Teofilo F.

Publisher

Elsevier BV

Subject

Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science

Reference9 articles.

1. Optimal packing and covering in the plane are NP-complete;Flower;Inform. Process. Lett.,1981

2. The on-line d-dimensional dictionary problem;Gonzalez,1990

3. Covering a set of points with fixed size hypersquares and related problems;Gonzalez;Proc. 28th Ann. Allerton Conf. on Communications, Control, and Computing,1990

4. Approximation schemes for covering and packing problems in image processing and VLSI;Hochbaum;J. ACM,1985

5. The NP-completeness column: An ongoing guide;Johnson;J. Algorithms,1982

Cited by 65 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. Parallel algorithms for minimum general partial dominating set and maximum budgeted dominating set in unit disk graph;Theoretical Computer Science;2022-10