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 var...
详细信息
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 y and the maximum difference 8 between consecutive vector entries, we obtain a refined picture of the computational (in-)tractability of these problems. For example, we show that VEcrox EXPLANATION is fixed-parameter tractable with respect to delta, and that, unless NP subset of coNP/poly, there is no polynomial kernelization for vector POSITIVE EXPLANATION with respect to the parameter gamma. We also identify relevant special cases where vector POSITIVE EXPLANATION is algorithmically harder than vector EXPLANATION. (C) 2015 Elsevier Inc. All rights reserved.
暂无评论