Search Results - Zero-sum Partition Algorithmic complexity Inapproximability FPT

The Maximum Zero-Sum Partition problem by Fertin, Guillaume, Fontaine, Oscar, Jean, Géraldine, Vialette, Stéphane

“…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…”
Get full text