Showing 2023Show all
3 papers · 1 filter
math.OC2023
Tight Bounds for the Maximum Distance Over a Polytope to a Given Point
Marius Costandin, Beniamin Costandin
In this paper we study the problem of maximizing the distance to a given point over a polytope . Assuming that the polytope is circumscribed by a known ball we c…
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…