Author:
Madireddy Raghunath Reddy,Nandy Subhas C.,Pandit Supantha
Publisher
Springer International Publishing
Reference21 articles.
1. Alimonti, P., Kann, V.: Some APX-completeness results for cubic graphs. Theoret. Comput. Sci. 237(1), 123–134 (2000)
2. de Berg, M., Khosravi, A.: Optimal binary space partitions for segments in the plane. Int. J. Comput. Geom. Appl. 22(3), 187–206 (2012)
3. Carr, R.D., Doddi, S., Konjevod, G., Marathe, M.: On the red-blue set cover problem. In: SODA, pp. 345–353 (2000)
4. Chan, T.M., Grant, E.: Exact algorithms and APX-hardness results for geometric packing and covering problems. Comput. Geom. 47(2), 112–124 (2014)
5. Chan, T.M., Hu, N.: Geometric red blue set cover for unit squares and related problems. Comput. Geom. 48(5), 380–385 (2015)