## Abstract

We extend previous studies on "explaining" a nonnegative integer vector by sums of few homogeneous segments, that is, vectors where all nonzero entries are equal and consecutive. We study two NP-complete variants which are motivated by radiation therapy and database applications. In Vector Positive Explanation, the segments may have only positive integer entries; in Vector Explanation, the segments may have arbitrary integer entries. Considering several natural parameterizations such as the maximum vector entry γ and the maximum difference δ between consecutive vector entries, we obtain a refined picture of the computational (in-)tractability of these problems. For example, we show that Vector Explanation is fixed-parameter tractable with respect to δ, and that, unless NPcoNP/poly, there is no polynomial kernelization for Vector Positive Explanation with respect to the parameter γ. We also identify relevant special cases where Vector Positive Explanation is algorithmically harder than Vector Explanation.

Original language | English |
---|---|

Pages (from-to) | 766-782 |

Number of pages | 17 |

Journal | Journal of Computer and System Sciences |

Volume | 81 |

Issue number | 4 |

DOIs | |

State | Published - 1 Jun 2015 |

Externally published | Yes |

## Keywords

- Exact algorithms
- Matrix and vector decomposition
- Multivariate algorithmics
- NP-hardness
- Parameterized complexity

## ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Networks and Communications
- Computational Theory and Mathematics
- Applied Mathematics