Asymptotic analysis of an algorithm for balanced parallel processor scheduling
SIAM Journal on Computing
A complete anytime algorithm for number partitioning
Artificial Intelligence
The importance of importance sampling
Computing in Science and Engineering
Selected papers on analysis of algorithms
Selected papers on analysis of algorithms
Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
The Differencing Method of Set Partitioning
The Differencing Method of Set Partitioning
| Hi-index | 0.00 |
An integer partition for a set of integers is a way to divide that set of numbers into two or more subsets, with approximately the same sum in each subset and the same number of elements in each subset. The authors have developed a method to estimate the work done by commonly used algorithms. Their method is based on one of Knuth's methods for estimating the size of backtrack trees.