A. Büchel

collaborators

2 papers

math.CO2018

An output-sensitive Algorithm to partition a Sequence of Integers into Subsets with equal Sums

Alexander Büchel, Ulrich Gilleßen, Kurt-Ulrich Witt

We present a polynomial time algorithm, which solves a nonstandard Variation of the well-known PARTITION-problem: Given positive integers $n, k$ and $t$ such that $t \geq n$ and $k…

math.CO2017

An efficient Algorithm to partition a Sequence of Integers into Subsets with equal Sums

Alexander Büchel, Ulrich Gilleßen, Kurt-Ulrich Witt

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…