论文标题
多路数分区：信息理论视图
Multi-Way Number Partitioning: an Information-Theoretic View
论文作者
论文摘要
数字分区问题是将给定数字列表划分为多个子集的问题，以便每个子集中的数字之和尽可能相等。我们介绍了两个密切相关的“最有用”和“最可压缩”分区的概念。大多数信息分区都满足最佳属性原则。我们还提供了一个精确的算法（基于Huffman编码），在输入大小N中的运行时间为O（NLOG（n）），以找到最可压缩的分区。
The number partitioning problem is the problem of partitioning a given list of numbers into multiple subsets so that the sum of the numbers in each subset are as nearly equal as possible. We introduce two closely related notions of the "most informative" and "most compressible" partitions. Most informative partitions satisfy a principle of optimality property. We also give an exact algorithm (based on Huffman coding) with a running time of O(nlog(n)) in input size n to find the most compressible partition.
