1. Amenta, N.: Helly-type theorems and generalized linear programming. Ph.D. thesis, University of California at Berkeley (1992)
2. Badoiu, M., Clarkson, K.L.: Smaller core-sets for balls. In: SODA’03: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 801–802. SIAM, Philadelphia (2003)
3. Badoiu, M., Clarkson, K.L.: Optimal core-sets for balls. Comput. Geom. 40(1), 14–22 (2008)
4. Badoiu, M., Har-Peled, S., Indyk, P.: Approximate clustering via core-sets. In: STOC’02: Proc. of the 34th Annual ACM Symposium on Theory of Computing, pp. 250–257. ACM, New York (2002)
5. Bohnenblust, H.F.: Convex regions and projections in Minkowski spaces. Ann. Math. 39, 301–308 (1938)