Design and performance evaluation of sequence partition algorithms

Journal of Computer Science and Technology

Volumn 23, Issue 5, 2008, Pages 711-718

  Yang, Bing ^a   Chen, Jing ^b   Lu, En Yue ^c   Zheng, Si Qing ^b  

^a CISCO SYSTEMS   (United States)

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

^c SALISBURY UNIVERSITY   (United States)

Author keywords

Approximation; Complexity; Monotone subsequence; NP complete; Permutation algorithm

Indexed keywords

APPROXIMATION; COMPLEXITY; MONOTONE SUBSEQUENCE; NP-COMPLETE; PERMUTATION ALGORITHM;

ALGORITHMS; MATHEMATICAL TRANSFORMATIONS; NUCLEAR PROPULSION; POLYNOMIAL APPROXIMATION; SOLUTIONS;

APPROXIMATION ALGORITHMS;

EID: 55549136399     PISSN: 10009000     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11390-008-9183-2     Document Type: Article

References (17)

1. P Erdös G Szekeres 1935 A combinatorial problem in geometry Compositio Mathematica 2 463 470
2. R B Yehuda S Fogel 1998 Partitioning a sequence into few monotone subsequences Acta Informatica 35 5 421 440
3. F V Fomin D Kratsch J Novelli 2002 Approximating minimum cocolorings Information Processing Letters 84 5 285 290
4. A Brandstädt D Kratsch 1986 On partitions of permutations into increasing and decreasing subsequences Elektron. Inf. Verarb. Kybern. 22 263 273
5. K Wagner 1984 Monotonic coverings of finite sets Elektron. Inf. Verarb. Kybern. 20 12 633 639 Dec.
6. P Erdös J Gimbel D Kratsch 1991 Some extremal results in cochromatic and dichromatic theory Journal of Graph Theory 15 579 585
7. J S Myers 2002 The minimum number of monotone subsequences Electronic Journal of Combinatorics 9 2 R4
8. C A Tracy H Widom 2001 On the distributions of the lengths of the longest monotone subsequences in random words Probab. Theory Relat. Fields 119 350 380
9. R Siders 1999 Monotone subsequences in any dimension Journal of Combinatorial Theory, Series A 85 2 243 253
10. Matoušek J, Welzl E. Good splitters for counting points in triangles. In Proc. The 5th Ann. ACM Conf. Computational Geometry, 1989, pp.124-130.
11. M L Fredman 1975 On computing the length of longest increasing subsequences Discrete Mathematics 11 29 35
12. R P Dilworth 1950 A decomposition theorem for partially ordered sets Annals of Mathematics 51 1 161 166
13. A Frank 1980 On chain and antichain families of a partially ordered set Journal of Combinatorial Theory, Series B 29 176 184
14. A J Hoffman D E Schwartz 1977 On partitions of a partially ordered set Journal of Combinatorial Theory, Series B 23 3 13
15. C Greene D J Kleitman 1976 The structure of sperner k-families Journal of Combinatorial Theory, Series A 20 41 68
16. C Greene 1976 Some partitions associated with a partially ordered set Journal of Combinatorial Theory, Series A 20 69 79
17. C Greene D J Kleitman 1976 Strong versions of sperner's theorem Journal of Combinatorial Theory, Series A 20 80 88