On Maximizing the Distance to a Given Point over an Intersection of Balls II

by   Marius Costandin, et al.

In this paper the problem of maximizing the distance to a given fixed point over an intersection of balls is considered. It is known that this problem is NP complete in the general case, since any subset sum problem can be solved upon solving a maximization of the distance over an intersection of balls to a point inside the convex hull. The general context is: in [1] it is shown that exists a polynomial algorithm which always solves the maximization problem if the given point is outside the convex hull of the centers of the balls. Naturally one asks if there is a polynomial algorithm which solves the problem for a point inside the convex hull. A conjecture stated in a previous paper, [1] is proved, under slightly stronger conditions. The proven conjecture allows a polynomial algorithm for points on the facets of the convex hull and shows that such points share the maximizer with all the points in a small enough ball centered at it, thus including points in the interior of the convex hull of the ball centers.


An improved judgement algorithm of point in-out convex polygons

This paper proposed a method to judge whether the point is inside or out...

Negative Instance for the Edge Patrolling Beacon Problem

Can an infinite-strength magnetic beacon always “catch” an iron ball, wh...

Range Assignment of Base-Stations Maximizing Coverage Area without Interference

We study the problem of assigning non-overlapping geometric objects cent...

Provable Certificates for Adversarial Examples: Fitting a Ball in the Union of Polytopes

We propose a novel method for computing exact pointwise robustness of de...

Existence of a Convex Polyhedron with Respect to the Given Radii

Given a set of radii measured from a fixed point, the existence of a con...

Randomized Quasi Polynomial Algorithm for Subset-Sum Problems with At Most One Solution

In this paper we study the Subset Sum Problem (SSP). Assuming the SSP ha...

Optimal General Factor Problem and Jump System Intersection

In the optimal general factor problem, given a graph G=(V, E) and a set ...

Please sign up or login with your details

Forgot password? Click here to reset