Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

JDA
2008

favoriteEmaildiscussreport

67views more JDA 2008»

On minimum k-modal partitions of permutations

13 years 4 months ago

On minimum k-modal partitions of permutations

Download www.math.tu-berlin.de

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

Real-time Traffic

JDA 2008 | Minimum Number | Monotone Subsequences | Permutation |

claim paper

Related Content

» Minimum Common String Partition Problem Hardness and Approximations

» LRMTrees Compressed Indices Adaptive Sorting and Compressed Permutations

» Bin Packing via Discrepancy of Permutations

» FixedParameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing

Post Info
More Details (n/a)

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)