标题： 最小相交和最小包含球 显示英文标题

标题： Smallest Intersecting and Enclosing Balls

摘要： 我们研究了欧几里得空间中紧致且凸的输入对象的最小相交球和最小包含球问题。这些问题将并统一了许多计算几何和机器学习中的问题。我们证明这两个问题都可以建模为零和博弈，并提出了一种近似算法用于前者。具体来说，该算法为各种输入对象（如凸多面体、球体、椭球体等）在高维空间中产生了第一个结果。 显示英文摘要

摘要： We study the smallest intersecting and enclosing ball problems in Euclidean spaces for input objects that are compact and convex. They link and unify many problems in computational geometry and machine learning. We show that both problems can be modeled as zero-sum games, and propose an approximation algorithm for the former. Specifically, the algorithm produces the first results in high-dimensional spaces for various input objects such as convex polytopes, balls, ellipsoids, etc.