Author:
Bereg Sergey,Daescu Ovidiu,Zivanic Marko,Rozario Timothy
Publisher
Springer International Publishing
Reference9 articles.
1. Barbay, J., Chan, T.M., Navarro, G., Pérez-Lantero, P.: Maximum-weight planar boxes in
$$O(n^2)$$
time (and better). Inf. Process. Lett. 114(8), 437–445 (2014)
2. Carr, R.D., Doddi, S., Konjevod, G., Marathe, M.: On the red-blue set cover problem. In: Proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 345–353 (2000)
3. Chan, T.M., Hu, N.: Geometric red-blue set cover for unit squares and related problems. Comput. Geom. 48(5), 380–385 (2015)
4. Bitner, S., Cheung, Y.K., Daescu, O.: Minimum separating circle for bichromatic points in the plane. In: Proceedings of the 7th International Symposium on Voronoi Diagrams in Science and Engineering, pp. 50–55 (2010)
5. Lecture Notes in Computer Science;YK Cheung,2011
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献