5 search results - page 1 / 1 » On minimum k-modal partitions of permutations |
JDA
2008
13 years 5 months ago
2008
Partitioning a permutation into a minimum number of monotone subsequences is NP-hard. We extend this complexity result
ISAAC
2004
Springer
13 years 10 months ago
2004
Springer
String comparison is a fundamental problem in computer science, with applications in areas such as computational biology, text processing or compression. In this paper we address t...
CORR
2010
Springer
12 years 12 months ago
2010
Springer
LRM-Trees are an elegant way to partition a sequence of values into sorted consecutive blocks, and to express the relative position of the first element of each block within a prev...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
A well studied special case of bin packing is the 3-partition problem, where n items of size > 1 4 have to be packed in a minimum number of bins of capacity one. The famous Kar...
SWAT
2010
Springer
13 years 10 months ago
2010
Springer
Given a permutation π of {1, . . . , n} and a positive integer k, we give an algorithm with running time 2O(k2 log k) nO(1) that decides whether π can be partitioned into at mos...