|Title:||P,ARTITl.ONING A SEQUENCF INTO FEW MONOTONE SUBSEQUENCES
|Authors:||R. Bar-Yehu9a anq S. Fogel
|Abstract:||In this paper we consider the problem of finding sets of long disjoint monotone subsequences of a. sequence oŁ n numbers. We give lUI a.Igorithm that, a.fter O(n log n) preprocessing time, finds and deletes an increasing subsequence of size k (if it exists) in time O(n +k3). Using this algorithm, it is possible to partition a. sequence of n numbers into 2L..fiiJ monotone subsequences in time O(nU ). Monotone subsequences have a.pplica.tions in computational geometry for two dimensiona.l simplex range sea.rching 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/1990/CS/CS0640), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 1990
To the main CS technical reports page
Computer science department, Technion