The search result changed since you submitted your search request. Documents might be displayed in a different sort order.
  • search hit 25 of 25
Back to Result List

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

  • We present a polynomial time algorithm, which solves a nonstandard Variation of the well-known PARTITION-problem.

Download full text files

Export metadata

Additional Services

Share in Twitter Search Google Scholar Availability
Metadaten
Document Type:Article
Language:English
Author:Alexander Büchel, Ulrich Gilleßen, Kurt-Ulrich Witt
Parent Title (German):DMTCS (Discrete Mathematics and Theoretical Computer Science)
Volume:20
Issue:2
Pagenumber:13
ISSN:1365–8050
URN:urn:nbn:de:hbz:1044-opus-43162
DOI:https://doi.org/10.23638/DMTCS-20-2-18
ArXiv Id:http://arxiv.org/abs/1811.04014
Publisher:Maison de l'Informatique et des Mathématiques Discrètes
Place of publication:Strasbourg, France
Publishing Institution:Hochschule Bonn-Rhein-Sieg
Date of first publication:2019/01/24
Note:
(c) 2018 by the authors, distributed under a Creative Commons Attribution 4.0 International License
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:2019/01/03
Licence (German):License LogoCreative Commons - CC BY - Namensnennung 4.0 International