In this paper we propose a new integer programming formulation for the multilevel facility location problem and a novel 3-approximation algorithm based on LP rounding. The linear ...
Abstract. We consider a generalization of the classical max-cut problem where two objective functions are simultaneously considered. We derive some theorems on the existence and th...
Eric Angel, Evripidis Bampis, Laurent Gourvè...
In this paper we consider problems related to the sortedness of a data stream. First we investigate the problem of estimating the distance to monotonicity; given a sequence of len...
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
We address a version of the set-cover problem where we do not know the sets initially (and hence referred to as covert) but we can query an element to find out which sets contain ...