We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of...
Abstract. We present the newly developed core concept for the Multidimensional Knapsack Problem (MKP) which is an extension of the classical concept for the one-dimensional case. T...
We consider the problem of optimizing multilabel MRFs, which is in general NP-hard and ubiquitous in low-level computer vision. One approach for its solution is to formulate it as...
Pushmeet Kohli, Alexander Shekhovtsov, Carsten Rot...
The problem of interest is covering a given point set with homothetic copies of several convex containers C1,...,Ck, while the objective is to minimize the maximum over the dilatat...