On minimum k-modal partitions of permutations

14 years 13 days ago

Partitioning a permutation into a minimum number of monotone subsequences is NP-hard. We extend this complexity result

Gabriele Di Stefano, Stefan Krause, Marco E. L&uum

JDA 2008 | Minimum Number | Monotone Subsequences | Permutation |

claim paper

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2008
Where	JDA
Authors	Gabriele Di Stefano, Stefan Krause, Marco E. Lübbecke, Uwe T. Zimmermann

Comments (0)