Volltext-Downloads (blau) und Frontdoor-Views (grau)
The search result changed since you submitted your search request. Documents might be displayed in a different sort order.
  • search hit 10 of 56
Back to Result List

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.

Export metadata

Additional Services

Share in Twitter Search Google Scholar Availability


Document Type:Preprint
Author:Alexander Büchel, Ulrich Gilleßen, Kurt-Ulrich Witt
ArXiv Id:http://arxiv.org/abs/1706.06425
Date of first publication:2017/06/20
Tag: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