Note: On the greedy algorithm for optimal assembly

The greedy and balanced algorithms for the optimal assembly of arbitrary structure functions (not necessarily binary) are discussed. Conditions under which these algorithms yield optimal configurations are deduced. © 1992 John Wiley & Sons, Inc.