An efficient Algorithm to partition a Sequence of Integers into Subsets with equal Sums
Combinatorics
2018-07-17 v3
Abstract
To partition a sequence of n integers into subsets with prescribed sums is an NP-hard problem in general. In this paper we present an efficient solution for the homogeneous version of this problem; i.e. where the elements in each subset add up to the same sum.
Cite
@article{arxiv.1706.06425,
title = {An efficient Algorithm to partition a Sequence of Integers into Subsets with equal Sums},
author = {Alexander Büchel and Ulrich Gilleßen and Kurt-Ulrich Witt},
journal= {arXiv preprint arXiv:1706.06425},
year = {2018}
}
Comments
12 pages