Publication type: in Preparation

We study the Recoverable Selection problem, a generalization of the well-studied classic Selection problem. Given an element set , two cost vectors and two parameters , we want to find sets such that and minimizing the cost . We show that a simple greedy algorithm solves this problem to optimality.  By a detailed mathematical analysis […]

Comments Off on Efficient Algorithms for the Recoverable (Robust) Selection Problem