Content deleted Content added
Erel Segal (talk | contribs) |
Erel Segal (talk | contribs) |
||
Line 50:
*For two-way partitioning, when inputs are uniformly-distributed random variables, the expected difference between largest and smallest sum is <math>n^{-\Theta(\log n)}</math>. <ref name=":1" />
== Balanced two-way partitioning{{Anchor|balanced}} ==
Several variants of LDM were developed for the ''balanced'' number partitioning problem, in which all subsets must have the same cardinality (up to 1).
| |||