Is a Finite Intersection of Balls Covered by a Finite Union of Balls in Euclidean Spaces? - Runge, Vincent (Journal of optimization theory and applications, 2020)
Keywords: Algorithms; Applications of Mathematics; Calculus of Variations and Optimal Control; Optimization; Computational geometry; Convexity; Dynamic programming; Engineering; Enumeration; Euclidean geometry; Euclidean space; Mathematics; Mathematics and Statistics; Operations Research/Decision Theory; Optimization; Polyhedra; Polynomials; Programming languages; Quadratic programming; Theory of Computation; Computational geometry; Nonconvex quadratically constrained quadratic programming; Voronoi-like polyhedron; Vertex enumeration; 90C26; Polynomial time complexity; 68U05; 52C17; Ball covering problem; 62L10