The Maximum Zero-Sum Partition Problem
Résumé
We study the Maximum Zero-Sum Partition problem (or MZSP), defined as follows: given a multiset S={a1, a2, ..., an} of integers ai∈Z* such that Σi=1..n ai=0, find a maximum cardinality partition {S1, S2, ... , Sk} of S such that, for every 1≤ i ≤ k, Σaj ∈ Si aj=0. Solving MZSP is useful in genomics for computing evolutionary distances between pairs of species. Our contributions are a series of algorithmic results concerning MZSP, in terms of complexity, (in)approximability, with a particular focus on the fixed-parameter tractability of MZSP with respect to either (i) the size k of the solution, (ii) the number of negative (resp. positive) values in S and (iii) the largest integer in S.
Domaines
Informatique [cs]| Origine | Fichiers produits par l'(les) auteur(s) |
|---|