Skip to main content
SpringerLink
Log in
Book cover

International Conference on Theory and Applications of Models of Computation

TAMC 2007: Theory and Applications of Models of Computation pp 46–57Cite as

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

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4484))

Abstract

Tradeoffs between time complexities and solution optimalities are important when selecting algorithms for an NP-hard problem in different applications. Also, the distinction between theoretical upper bound and actual solution optimality for realistic instances of an NP-hard problem is a factor in selecting algorithms in practice. We consider the problem of partitioning a sequence of n distinct numbers into minimum number of monotone (increasing or decreasing) subsequences. This problem is NP-hard and the number of monotone subsequences can reach in the worst case. We introduce a new algorithm, the modified version of the Yehuda-Fogel algorithm, that computes a solution of no more than monotone subsequences in O(n 1.5) time. Then we perform a comparative experimental study on three algorithms, a known approximation algorithm of approximation ratio 1.71 and time complexity O(n 3), a known greedy algorithm of time complexity O(n 1.5logn), and our new modified Yehuda-Fogel algorithm. Our results show that the solutions computed by the greedy algorithm and the modified Yehuda-Fogel algorithm are close to that computed by the approximation algorithm even though the theoretical worst-case error bounds of these two algorithms are not proved to be within a constant times of the optimal solution. Our study indicates that for practical use the greedy algorithm and the modified Yehuda-Fogel algorithm can be good choices if the running time is a major concern.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Erdös, P., Szekeres, G.: A Combinatorial Problem in Geometry. Compositio Mathematica 2, 463–470 (1935)

    MathSciNet  MATH  Google Scholar 

  2. Yehuda, R.B., Fogel, S.: Partitioning a Sequence into Few Monotone Subsequences. Acta Informatica 35, 421–440 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  3. Fomin, F.V., Kratsch, D., Novelli, J.: Approximating Minimum Cocolorings. Information Processing Letters 84, 285–290 (2002)

    MathSciNet  MATH  Google Scholar 

  4. Brandstädt, A., Kratsch, D.: On Partitions of Permutations into Increasing and Decreasing Subsequences. Elektron. Inf. Verarb. Kybern. 22, 263–273 (1986)

    MATH  Google Scholar 

  5. Wagner, K.: Monotonic Coverings of Finite Sets. Elektron. Inf. Verarb. Kybern. 20, 633–639 (1984)

    MATH  Google Scholar 

  6. Erdös, P., Gimbel, J., Kratsch, D.: Some Extremal Results in Cochromatic and Dichromatic Theory. Journal of Graph Theory 15, 579–585 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  7. Myers, J.S.: The Minimum Number of Monotone Subsequences. Electronic Journal of Combinatorics 9(2), R4 (2002)

    Google Scholar 

  8. Tracy, C.A., Widom, H.: On the Distributions of the Lengths of the Longest Monotone Subsequences in Random Words. Probab. Theory Relat. Fields 119, 350–380 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  9. Siders, R.: Monotone Subsequences in Any Dimension. Journal of Combinatorial Theory, Series A 85, 243–253 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  10. Matoušek, J., Welzl, E.: Good splitters for counting points in triangles. In: The 5th Ann. ACM Conf. On Computational Geometry, pp. 124–130 (1989)

    Google Scholar 

  11. Fredman, M.L.: On Computing the Length of Longest Increasing Subsequences. Discrete Mathematics 11, 29–35 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  12. Dilworth, R.P.: A Decomposition Theorem for Partially Ordered Sets. Annals of Mathematics 51(1), 161–166 (1950)

    Article  MathSciNet  Google Scholar 

  13. Frank, A.: On Chain and Antichain Families of a Partially Ordered Set. Journal of Combinatorial Theory, Series B 29, 176–184 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  14. Hoffman, A.J., Schwartz, D.E.: On Partitions of a Partially Ordered Set. Journal of Combinatorial Theory, Series B 23, 3–13 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  15. Greene, C., Kleitman, D.J.: The Structure of Sperner k-Families. Journal of Combinatorial Theory, Series A 20, 41–68 (1976)

    Article  MathSciNet  Google Scholar 

  16. Greene, C.: Some Partitions Associated with a Partially Ordered Set. Journal of Combinatorial Theory, Series A 20, 69–79 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  17. Greene, C., Kleitman, D.J.: Strong Versions of Sperner’s Theorem. Journal of Combinatorial Theory, Series A 20, 80–88 (1976)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Cisco Systems, 2200 East President George Bush Highway, Richardson, TX 75082,  

    Bing Yang

  2. Telecom. Engineering Program, University of Texas at Dallas, Richardson, TX 75083,  

    Jing Chen & S. Q. Zheng

  3. Math. and Computer Science Dept., Salisbury University, Salisbury, MD 21801,  

    Enyue Lu

  4. Dept. of Computer Science, University of Texas at Dallas, Richardson, TX 75083,  

    S. Q. Zheng

Authors
  1. Bing Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jing Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Enyue Lu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. S. Q. Zheng
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jin-Yi Cai S. Barry Cooper Hong Zhu

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yang, B., Chen, J., Lu, E., Zheng, S.Q. (2007). A Comparative Study of Efficient Algorithms for Partitioning a Sequence into Monotone Subsequences. In: Cai, JY., Cooper, S.B., Zhu, H. (eds) Theory and Applications of Models of Computation. TAMC 2007. Lecture Notes in Computer Science, vol 4484. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72504-6_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-72504-6_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-72503-9

  • Online ISBN: 978-3-540-72504-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation