1. P.K. Agarwal, M. van Kreveld, S. Suri, Label placement by maximum independent set in rectangles, Proc. 9th Canad. Conf. Comput. Geom., 1997, pp. 233–238.
2. Parallel Computational Geometry;Akl,1993
3. S. Arora, D. Karger, M. Karpinski, Polynomial-time approximation schemes for dense instances of NP-hard problems, Symp. on Theory of Comp., 1995, pp. 284–293.
4. E. Assa, M.J. Katz, p-piercing sets of boxes and polytopes, Personal communication, 1998.
5. M. Bellare, M. Sudan, Improved non-approximability results, Proc. 26th Annu. ACM Symp. Theory Comput., 1994, pp. 184–193.