A comparative study of efficient algorithms for partitioning a sequence into monotone subsequences

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4484 LNCS, Issue , 2007, Pages 46-57

  Yang, Bing ^a   Chen, Jing ^b   Lu, Enyue ^c   Zheng, S Q ^b  

^a CISCO SYSTEMS   (United States)

^b The University of Texas at Dallas   (United States)

^c SALISBURY UNIVERSITY   (United States)

Author keywords

Algorithm; Approximation; Complexity; Monotone; NP complete; Permutation; Subsequence

Indexed keywords

COMPUTATIONAL COMPLEXITY; ERROR ANALYSIS; OPTIMIZATION; PROBLEM SOLVING;

APPROXIMATION RATIO; MONOTONE; PERMUTATION; YEHUDA-FOGEL ALGORITHM;

ALGORITHMS;

EID: 35448961701     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72504-6_4     Document Type: Conference Paper

References (17)

1. P. Erdös and G. Szekeres, "A Combinatorial Problem in Geometry", Compositio Mathematica 2 (1935) 463-470.
2. R. B. Yehuda and S. Fogel, "Partitioning a Sequence into Few Monotone Subsequences", Acta Informatica 35 (1998) 421-440.
3. F. V. Fomin, D. Kratsch and J. Novelli, "Approximating Minimum Cocolorings", Information Processing Letters 84 (2002) 285-290.
4. A. Brandstädt and D. Kratsch, "On Partitions of Permutations into Increasing and Decreasing Subsequences", Elektron. Inf. Verarb. Kybern. 22 (1986) 263-273.
5. K. Wagner, "Monotonic Coverings of Finite Sets", Elektron. Inf. Verarb. Kybern. 20 (1984) 633-639.
6. P. Erdös, J. Gimbel and D. Kratsch, "Some Extremal Results in Cochromatic and Dichromatic Theory", Journal of Graph Theory 15 (1991) 579-585.
7. J. S. Myers, "The Minimum Number of Monotone Subsequences", Electronic Journal of Combinatorics 9(2) (2002) R4.
8. C. A. Tracy and H. Widom, "On the Distributions of the Lengths of the Longest Monotone Subsequences in Random Words", Probab. Theory Relat. Fields 119 (2001) 350-380.
9. R. Siders, "Monotone Subsequences in Any Dimension", Journal of Combinatorial Theory, Series A 85 (1999) 243-253.
10. J. Matoušek and E. Welzl, "Good splitters for counting points in triangles", The 5th Ann. ACM Conf. On Computational Geometry (1989) 124-130.
11. M. L. Fredman, "On Computing the Length of Longest Increasing Subsequences", Discrete Mathematics 11 (1975) 29-35.
12. R.P. Dilworth, "A Decomposition Theorem for Partially Ordered Sets", Annals of Mathematics 51(1) (1950) 161-166.
13. A. Frank, "On Chain and Antichain Families of a Partially Ordered Set", Journal of Combinatorial Theory, Series B 29 (1980) 176-184.
14. A. J. Hoffman and D. E. Schwartz, "On Partitions of a Partially Ordered Set", Journal of Combinatorial Theory, Series B 23 (1977) 3-13.
15. C. Greene and D. J. Kleitman, "The Structure of Sperner k-Families", Journal of Combinatorial Theory, Series A 20 (1976) 41-68.
16. C. Greene, "Some Partitions Associated with a Partially Ordered Set", Journal of Combinatorial Theory, Series A 20 (1976) 69-79.
17. C. Greene and D. J. Kleitman, "Strong Versions of Sperner's Theorem", Journal of Combinatorial Theory, Series A 20 (1976) 80-88.