This is a theoretical analysis of a probabilistic approach to solving packing or partitioning algorithms. These generally require the partitioning of a set of nonnegative numbers so that the sums of the elements in the blocks of the partition satisfy some given property. Departs from previous research on these types of algorithms in that it takes a probabilistic rather than a heuristic approach to solving them.

Скачать книгу бесплатно (djvu, 1.66 Mb)

---

Читать «Probabilistic analysis of packing partitioning algorithms»