| TR#: | CS0840 |
| Class: | CS |
| Title: | PARTITIONING A SEQUENCE INTO FEW
MONOTONE SUBSEQUENCES. |
| Authors: | R. Bar-Yehuda and S. Fogel |
| Not Available | |
| Abstract: | In this paper we consider the problem of finding sets of long disjoint monotone subsequences of a sequence of n numbers. We give an algorithm that, after O(n \log n) preprocessing time, finds and deletes an increasing subsequence of size k (if it exists) in time O(n+k^2). Using this algorithm, it is possible to partition a sequence of n into 2 \lfloor \sqrt{n} \rfloor monotone subsequences in time O(n^{1.5}). Monotone subsequences have applications in computational geometry for two dimensional simplex range searching and in VLSI for book embedding. |
| Copyright | The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information |
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1994/CS/CS0840), rather than to the URL of the PDF or PS files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 1994
To the main CS technical reports page