Exponentially small bounds on the expected optimum of the partition and subset sum problems

Random Structures and Algorithms

Volumn 12, Issue 1, 1998, Pages 51-62

  Lueker, George S ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Combinatorial optimization; Partition problem; Probabilistic analysis; Subset sum problem

Indexed keywords

EID: 0032330947     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1098-2418(199801)12:1<51::AID-RSA3>3.0.CO;2-S     Document Type: Article

References (11)

1. E. G. Coffman, Jr. and George S. Lueker, Probabilistic Analysis of Packing and Partitioning Algorithms, Wiley Interscience Series in Discrete Mathematics and Optimization, John Wiley & Sons, Inc., New York NY, 1991.
2. Michael R. Garey and David S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, New York, 1979.
3. A. V. Goldberg and A. Marchetti-Spaccamela. On finding the exact solution of a zero-one knapsack problem, Proceedings of the 16th Annual ACM Symposium on Theory of Computing, Washington, D.C., May 1984, pp. 359-368.
4. W. Hoeffding, Probability inequalities for sums of bounded random variables, J. Amer. Statist. Assoc. 58, 13-30 (1963).
5. Richard M. Karp, Reducibility among combinatorial problems, in Complexity of Computer Computations, Raymond E. Miller and James W. Thatcher, Eds. Plenum Press, New York, 1972, pp. 85-103.
6. Narendra Karmarkar and Richard M. Karp, The differencing method of set partitioning, Technical Report UCB/CSD 82/113, Computer Science Division (EECS), University of California, Berkeley, December 1982.
7. Narendra Karmarkar, Richard M. Karp, George S. Lueker, and Andrew M. Odlyzko, Probabilistic analysis of optimum partitioning, J. App. Probab., 23(3), 626-645 (1986).
8. G. S. Lueker, On the average difference between the solutions to linear and integer knapsack problems, in Applied Probability - Computer Science, The Interface, Ralph L. Disney and Teunis J. Ott, Eds., Vol. I, Birkhäuser, Boston, 1982, pp. 489-504.
9. Yehoshua Perl, Alon Itai, and Haim Avni, Interpolation search - a log log n search, Commun. ACM, 21(7), 550-553 (1978).
10. Li-Hui Tsai, Asymptotic analysis of an algorithm for balanced parallel processor scheduling, SlAM J. Comput., 21(1), 59-64 (1992).
11. Benjamin Yakir, The differencing algorithm LDM for partitioning: A proof of Karp's conjecture, Math. Oper. Res. 21(1), 85-99 (1996).