1. Aharoni, R., Haxell, P.: Hall’s theorem for hypergraphs. Journal of Graph Theory 35, 83–88 (2000)
2. Arkin, E., Hassin, R.: Minimum diameter covering problems. Networks 36, 147–155 (2000)
3. Baur, C., Fekete, S.: Approximation of geometric dispersion problems. Algorithmica, 30, 451???470 (2001);
4. A preliminary version appeared In: Jansen, K., Rolim, J.D.P. (eds.) APPROX 1998. LNCS, vol.??1444, pp. 451???470. Springer, Heidelberg (1998)
5. Cabello, S.: Approximation algorithms for spreading points. Technical report UU-CS-2003-040 (2003), Available at http://www.cs.uu.nl/research/techreps/UU-CS-2003-040.html