Probabilistic analysis of optimum partitioning

Given a set of n items with real-valued sizes, the optimum partition problem asks how it can be partitioned into two subsets so that the absolute value of the difference of the sums of the sizes over the two subsets is minimized. We present bounds on the probability distribution of this minimum under the assumption that the sizes are independent random variables drawn from a common distribution. For a large class of distributions, we determine the asymptotic behavior of the median of this minimum, and show that it is exponentially small.

[1]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1951 .

[2]  P. Billard.  Séries de Fourier aléatoirement bornées, continues, uniformément convergentes , 1965 .

[3]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1967 .

[4]  L. Shepp.  Covering the circle with random ARCS , 1972 .

[5]  L. A. Shepp,et al.  Covering the line with random intervals , 1972 .

[6]  J. Spencer.  Probabilistic Methods in Combinatorics , 1974 .

[7]  G. Grimmett,et al.  On colouring random graphs , 1975 .

[8]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[9]  Claude Puech,et al.  Probabilistic analysis of the subset-sum problem , 1982, Discret. Appl. Math..

[10]  George S. Lueker,et al.  On the Average Difference between the Solutions to Linear and Integer Knapsack Problems , 1982 .

[11]  Richard M. Karp,et al.  The Differencing Method of Set Partitioning , 1983 .

[12]  Richard Loulou,et al.  Tight Bounds and Probabilistic Analysis of Two Heuristics for Parallel Processor Scheduling , 1984, Math. Oper. Res..

[13]  Onno J. Boxma,et al.  A Probabilistic Analysis of the LPT Scheduling Rule , 1984, International Symposium on Computer Modeling, Measurement and Evaluation.

[14]  Edward G. Coffman,et al.  Expected Makespans for Largest-First Multiprocessor Scheduling , 1984, Performance.

[15]  Andrew V. Goldberg,et al.  On finding the exact solution of a zero-one knapsack problem , 1984, STOC '84.

[16]  E. G. Coffman,et al.  A Note on Expected Makespans for Largest-First Sequences of Independent Tasks on Two Processors , 1984, Math. Oper. Res..

[17]  John L. Bruno,et al.  Probabilistic Bounds on the Performance of List Scheduling , 1986, SIAM J. Comput..

[18]  J. B. G. Frenk,et al.  The rate of convergence to optimality of the LPT rule , 1986, Discret. Appl. Math..