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
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

03/11/1999

A complete anytime algorithm for balanced number partitioning

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

Verification and generation of unrefinable partitions

Unrefinable partitions are a subset of partitions into distinct parts wh...
10/17/2021

On Monotonicity of Number-Partitioning Algorithms

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

Load-Balancing for Parallel Delaunay Triangulations

Computing the Delaunay triangulation (DT) of a given point set in R^D is...
12/26/2020

Are Guessing, Source Coding, and Tasks Partitioning Birds of a Feather?

This paper establishes a close relationship among the four information t...
04/29/2017

A Partitioning Algorithm for Detecting Eventuality Coincidence in Temporal Double recurrence

A logical theory of regular double or multiple recurrence of eventualiti...
03/26/2021

Some properties of the parking function poset

In 1980, Edelman defined a poset on objects called the noncrossing 2-par...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.