The Maximum Zero-Sum Partition problem

We study the Maximum Zero-Sum Partition problem (or MZSP), defined as follows: given a multiset S={a1,a2,…,an} of integers ai∈Z⁎ (where Z⁎ denotes the set of non-zero integers) such that ∑i=1nai=0, find a maximum cardinality partition {S1,S2,…,Sk} of S such that, for every 1≤i≤k, ∑aj∈Siaj=0. Solving...

Full description

Bibliographic Details

Published in:	Theoretical computer science Vol. 1019; p. 114811
Main Authors:	Fertin, Guillaume, Fontaine, Oscar, Jean, Géraldine, Vialette, Stéphane
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.12.2024 Elsevier
Subjects:	Algorithmic complexity Engineering Sciences FPT Inapproximability Partition Zero-sum Algorithmic complexity Partition FPT Zero-sum Inapproximability Zero-sum Partition Algorithmic complexity Inapproximability FPT
ISSN:	0304-3975, 1879-2294
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!