Given a metric space X, a set of clients C X, and a set of facilities F X, such that X = F S C. the fault-tolerant k-median problem (FTM) requires to open k facilities in F so as to minimize the sum of distances from each ...

Given a set of axis-parallel rectangles on a plane, can you cut out a constant fraction of them using only Guillotine cuts? We try to answer this question in the project. The general problem of cutting out convex sets was ...

Traditionally, algorithms try to find the optimal solution for a problem in a “three-phase” approach: fetch the input, run the algorithm, output the solution. But recently, there has been an interest in understanding ...