Is a Finite Intersection of Balls Covered by a Finite Union of Balls in Euclidean Spaces ?

by   Vincent Runge, et al.

Considering a finite intersection of balls and a finite union of other balls in an Euclidean space, we build an exact and efficient test answering the question of the cover of the intersection by the union. This covering problem can be reformulated into quadratic programming problems, whose resolution for minimum and maximum gives information about a possible overlap between the frontier of the union and the intersection of balls. Obtained feasible regions are convex polyhedra, which are non-degenerate for many applications. Therefore, the initial nonconvex geometric problem, which is NP-hard in general, is now tractable in polynomial time by vertex enumeration. This time complexity reduction is due to the simple geometry of our problem involving only balls. The nonconvex maximum problems can be skipped when some mild conditions are satisfied. In this case, we only solve a collection of convex quadratic programming problems in polynomial time complexity. Simulations highlight the accuracy and efficiency of our approach compared with competing algorithms for nonconvex quadratically constrained quadratic programming. This work is motivated by an application in statistics to the problem of multidimensional changepoint detection using pruned dynamic programming algorithms for genomic data.


page 1

page 2

page 3

page 4


Dynamic Programming Approach to the Generalized Minimum Manhattan Network Problem

We study the generalized minimum Manhattan network (GMMN) problem: given...

The Inverse Problems of some Mathematical Programming Problems

The non-convex quadratic orogramming problem and the non-monotone linear...

On the Difficulty of Intersection Checking with Polynomial Zonotopes

Polynomial zonotopes, a non-convex set representation, have a wide range...

Absolute value linear programming

We deal with linear programming problems involving absolute values in th...

On Some Combinatorial Problems in Cographs

The family of graphs that can be constructed from isolated vertices by d...

The algorithm by Ferson et al. is surprisingly fast: An NP-hard optimization problem solvable in almost linear time with high probability

Ferson et al. (Reliable computing 11(3), p. 207--233, 2005) introduced a...

Sweeter than SUITE: Supermartingale Stratified Union-Intersection Tests of Elections

Stratified sampling can be useful in risk-limiting audits (RLAs), for in...

Please sign up or login with your details

Forgot password? Click here to reset