e/Smallest circle problem

Information
has gloss	eng: The smallest circle problem or minimum covering circle problem is a mathematical problem of computing the smallest circle that contains all of a given set of points in the Euclidean plane. The corresponding problem in n-dimensional space is to compute the smallest n-sphere that contains all of a given set of points. The smallest circle problem was initially proposed by the English mathematician James Joseph Sylvester in 1857.
lexicalization	eng: smallest circle problem
instance of	(noun) any circular or rotating mechanism; "the machine punched out metal circles" circle, round