I'm using CGAL's class Min_sphere_of_spheres_d<>
and would like to provide the appropriate academic reference describing the algorithm implemented. However, the documentation at
http://www.cgal.org/Manual/latest/doc_html/cgal_manual/Bounding_volumes_ref/Class_Min_sphere_of_spheres_d.html doesn't provide that. Is that perhaps because there is no academic article describing the algorithm?
The page you mention has a citation:
[MSW92] J. Matoušek, Micha Sharir, and Emo Welzl. A subexponential bound for linear programming. In Proc. 8th Annu. ACM Sympos. Comput. Geom., pages 1-8, 1992.