On Explaining Integer Vectors by Few Homogenous Segments

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F15%3A00237620" target="_blank" >RIV/68407700:21240/15:00237620 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1016/j.jcss.2014.12.028" target="_blank" >http://dx.doi.org/10.1016/j.jcss.2014.12.028</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.jcss.2014.12.028" target="_blank" >10.1016/j.jcss.2014.12.028</a>

Jazyk výsledku

angličtina

Název v původním jazyce

On Explaining Integer Vectors by Few Homogenous Segments

Popis výsledku v původním jazyce

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 textsc{Vector Positive Explanation}, the segments may have only positive integer entries; in textsc{Vector Explanation}, the segments may have arbitrary integer entries. Considering several natural parameterizations such as the maximum vector entry~$gamma$ and the maximum difference~$delta$ between consecutive vector entries, we obtain a refined picture of the computational (in-)tractability of these problems. For example, we show that textsc{Vector Explanation} is fixed-parameter tractable with respect to~$delta$, and that, unless $text{NP}subseteq text{{coNP/poly}}$, there is no polynomial kernelization for textsc{Vector Positive Explanation} with respect to the parameter~$gamma$. We also identify relev

Název v anglickém jazyce

On Explaining Integer Vectors by Few Homogenous Segments

Popis výsledku anglicky

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 textsc{Vector Positive Explanation}, the segments may have only positive integer entries; in textsc{Vector Explanation}, the segments may have arbitrary integer entries. Considering several natural parameterizations such as the maximum vector entry~$gamma$ and the maximum difference~$delta$ between consecutive vector entries, we obtain a refined picture of the computational (in-)tractability of these problems. For example, we show that textsc{Vector Explanation} is fixed-parameter tractable with respect to~$delta$, and that, unless $text{NP}subseteq text{{coNP/poly}}$, there is no polynomial kernelization for textsc{Vector Positive Explanation} with respect to the parameter~$gamma$. We also identify relev

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

—

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2015

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Journal of Computer and System Sciences

ISSN

0022-0000

e-ISSN

—

Svazek periodika

81

Číslo periodika v rámci svazku

4

Stát vydavatele periodika

NL - Nizozemsko

Počet stran výsledku

17

Strana od-do

766-782

Kód UT WoS článku

000349741800010

EID výsledku v databázi Scopus

2-s2.0-84925126440