Cargando…

The Complexity of Vector Partition

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 cluste...

Descripción completa

Detalles Bibliográficos
Autor principal: Onn, Shmuel
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Springer Nature Singapore 2021
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8438105/
https://www.ncbi.nlm.nih.gov/pubmed/34540950
http://dx.doi.org/10.1007/s10013-021-00523-6