Subject
Computational Mathematics,Computational Theory and Mathematics,Control and Optimization,Geometry and Topology,Computer Science Applications
Reference11 articles.
1. On the red–blue set cover problem;Carr,2000
2. Polynomial-time approximation schemes for packing and piercing fat objects;Chan;J. Algorithms,2003
3. Unit disk graphs;Clark;Discrete Math.,1990
4. Combination can be hard: approximability of the unique coverage problem;Demaine;SIAM J. Comput.,2008
5. Approximating geometric coverage problems;Erlebach,2008
Cited by
28 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献