4 papers
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…
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…
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…
Unconstraint minimization of continuous convex functions. Application to LP
Beniamin Costandin, Marius Costandin, Petru Dobra
Our contribution in this paper is two folded. We consider first the case of linear programming with real coefficients and give a method which allows the computation of a new upper…