The Complexity of Vector Partition

09/14/2021
by   Shmuel Onn, et al.
0

We consider the vector partition problem, where n agents, each with a d-dimensional attribute vector, are to be partitioned into p parts so as to minimize cost which is a given function on the sums of attribute vectors in each part. The problem has applications in a variety of areas including clustering, logistics and health care. We consider the complexity and parameterized complexity of the problem under various assumptions on the natural parameters p,d,a,t of the problem where a is the maximum absolute value of any attribute and t is the number of agent types, and raise some of the many remaining open problems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/28/2020

The Complexity of the Partition Coloring Problem

Given a simple undirected graph G=(V,E) and a partition of the vertex se...
research
07/28/2020

The Satisfactory Partition Problem

The Satisfactory Partition problem consists in deciding if the set of ve...
research
07/03/2023

Complexity Dichotomies for the Maximum Weighted Digraph Partition Problem

We introduce and study a new optimization problem on digraphs, termed Ma...
research
03/23/2019

Mechanism Design for Maximum Vectors

We consider the Maximum Vectors problem in a strategic setting. In the c...
research
09/04/2019

Parameterized Intractability of Even Set and Shortest Vector Problem

The k-Even Set problem is a parameterized variant of the Minimum Distanc...
research
01/04/2022

The cluster structure function

For each partition of a data set into a given number of parts there is a...
research
09/11/2015

Multi-Attribute Proportional Representation

We consider the following problem in which a given number of items has t...

Please sign up or login with your details

Forgot password? Click here to reset