Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference31 articles.
1. Agarwal, P.K., Pan, J.: Near-linear algorithms for geometric hitting sets and set covers. Discrete Comput. Geom. 63(2), 460–482 (2020)
2. Aschner, R., Katz, M.J., Morgenstern, G., Yuditsky, Y.: Approximation schemes for covering and packing. In: 7th International Workshop on Algorithms and Computation (Kharagpur 2013). Lecture Notes in Comput. Sci., vol. 7748, pp. 89–100. Springer, Heidelberg (2013)
3. Bansal, N., Pruhs, K.: Weighted geometric set multi-cover via quasi-uniform sampling. J. Comput. Geom. 7(1), 221–236 (2016)
4. Basu Roy, A., Govindarajan, S., Raman, R., Ray, S.: Packing and covering with non-piercing regions. Discrete Comput. Geom. 60(2), 471–492 (2018)
5. Brönnimann, H., Goodrich, M.T.: Almost optimal set covers in finite VC-dimension. Discrete Comput. Geom. 14(4), 463–479 (1995)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献