3 papers
cs.CG2024
On Efficient Approximation of the Maximum Distance to A Point Over an Intersection of Balls
Beniamin Costandin, Marius Costandin
In this paper we study the NP-Hard problem of maximizing the distance over an intersection of balls to a given point. We expand the results found in \cite{funcos1}, where the autho…
math.OC2023
A Quasi-Polynomial Algorithm for Subset-Sum Problems with At Most One Solution
Marius Costandin, Beniamin Costandin
In this paper we study the problem of maximizing the distance to a given point over an intersection of balls. It was already known that this problem can be solved in polynomial tim…
math.OC2023
On Maximizing the Distance to a Given Point over an Intersection of Balls II
Marius Costandin
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…