On Tue, Apr 15, 2008 at 10:50:23PM -0500, John Goerzen wrote:
Package: wnpp Severity: wishlist Owner: John Goerzen <email@example.com> * Package name : datapacker Version : 1.0.0 Upstream Author : John Goerzen <firstname.lastname@example.org> * URL : http://software.complete.org/datapacker * License : GPL Programming Lang: Haskell Description : Tool to pack files into minimum number of CDs/DVDs/etc datapacker is a tool to group files by size. It is designed to group files such that they fill fixed-size containers (called "bins") using the minimum number of containers.
This sounds suspiciously like the knapsack problem, which is in NP. Is it guaranteed to use the minimum number, or are there cases when it would not? If the former, I'm sure Merkle and Hellman would like to hear from you. ;-)
-- brian m. carlson / brian with sandals: Houston, Texas, US +1 713 440 7475 | http://crustytoothpaste.ath.cx/~bmc | My opinion only troff on top of XML: http://crustytoothpaste.ath.cx/~bmc/code/thwack OpenPGP: RSA v4 4096b 88AC E9B2 9196 305B A994 7552 F1BA 225C 0223 B187
Description: Digital signature