- search hit 1 of 1
An efficient Algorithm to partition a Sequence of Integers into Subsets with equal Sums
- 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.
Document Type: | Preprint |
---|---|
Language: | English |
Author: | Alexander Büchel, Ulrich Gilleßen, Kurt-Ulrich Witt |
Number of pages: | 12 |
DOI: | https://doi.org/10.48550/arXiv.1706.06425 |
ArXiv Id: | http://arxiv.org/abs/1706.06425 |
Publisher: | arXiv |
Date of first publication: | 2017/06/20 |
Keyword: | Cutting sticks problem; Set partition problem |
Departments, institutes and facilities: | Fachbereich Informatik |
Dewey Decimal Classification (DDC): | 5 Naturwissenschaften und Mathematik / 51 Mathematik / 510 Mathematik |
Entry in this database: | 2017/07/14 |