Greedy distributed set partitioning algorithm

This algorithm was introduced by Onn Shehory and Sarit Kraus. This algorithm works in not necessarily super-additive environments.1 In the following subsection we first describe the environment for this algorithm by mathematical means and then the algorithm itself. Sequentially we will discuss the limitations of described algorithm.

Description of the environment

I didn't find the perfect description of enviroments, in which this algorithm will work. But It seems to, that this algorithm is mostly used for super-additive enviroments.