A Comparative Study of Efficient Algorithms for Partitioning a Sequence into Monotone Subsequences

DOI10.1007/978-3-540-72504-6_4zbMath1198.68302OpenAlexW1553733426MaRDI QIDQ5425419

Bing Yang, Enyue Lü, Jing Chen, Si-Qing Zheng

Publication date: 13 November 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-72504-6_4

zbMATH Keywords

complexitypermutationNP-completeapproximation algorithmsmonotone subsequence

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Algorithms on strings (68W32)

Related Items (3)

Extreme Witnesses and Their Applications ⋮ Untangled monotonic chains and adaptive range search ⋮ Extreme witnesses and their applications

This page was built for publication: A Comparative Study of Efficient Algorithms for Partitioning a Sequence into Monotone Subsequences