Multi-Way Number Partitioning: an Information-Theoretic View

09/06/2020
by   Niloufar Ahmadypour, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/11/1999

A complete anytime algorithm for balanced number partitioning

Given a set of numbers, the balanced partioning problem is to divide the...
research
12/30/2021

Verification and generation of unrefinable partitions

Unrefinable partitions are a subset of partitions into distinct parts wh...
research
11/02/2022

Partitioning a Polygon Into Small Pieces

We study the problem of partitioning a given simple polygon P into a min...
research
10/17/2021

On Monotonicity of Number-Partitioning Algorithms

An algorithm for number-partitioning is called value-monotone if wheneve...
research
02/20/2019

Load-Balancing for Parallel Delaunay Triangulations

Computing the Delaunay triangulation (DT) of a given point set in R^D is...
research
11/08/2022

Bounded Guaranteed Algorithms for Concave Impurity Minimization Via Maximum Likelihood

Partitioning algorithms play a key role in many scientific and engineeri...
research
12/02/2015

Equal-image-size source partitioning: Creating strong Fano's inequalities for multi-terminal discrete memoryless channels

This paper introduces equal-image-size source partitioning, a new tool f...

Please sign up or login with your details

Forgot password? Click here to reset