TU Berlin

Research Group Algorithmics and Computational ComplexityTalk 09.07.2013

isti-logo

Page Content

to Navigation

On Explaining Integer Vectors by Few Homogenous Segments

Dipl.-Inf. Sepp Hartung (TU Berlin)

We extend previous studies on NP-hard problems dealing with the decomposition of nonnegative integer vectors into sums of few homogeneous segments. These problems are motivated by radiation therapy and database applications. If the segments may have only positive integer entries, then the problem is called Vector Explanation+. If arbitrary integer entries are allowed in the decomposition, then the problem is called Vector Explanation. Considering several natural parameterizations (including maximum vector entry, maximum di fference between consecutive vector entries, maximum segment length), we obtain a refi ned picture of the computational (in-)tractability of these problems. In particular, we show that in relevant cases Vector Explanation+ is algorithmically harder than Vector Explanation.

Date
Speaker
Location
Language
09.07.2013 14:15
Sepp Hartung
TEL 512
english/german

Back to the research colloquium site.

Navigation

Quick Access

Schnellnavigation zur Seite über Nummerneingabe