Space-Efficient Algorithms for Longest Increasing Subsequence

Given a sequence of integers, we want to find a longest increasing subsequence of the sequence. It is known that this problem can be solved in O n log n time and space. Our goal in this paper is to reduce the space consumption while keeping the time complexity small. For n ≤ s ≤ n , we present algor...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Theory of computing systems Ročník 64; číslo 3; s. 522 - 541
Hlavní autoři: Kiyomi, Masashi, Ono, Hirotaka, Otachi, Yota, Schweitzer, Pascal, Tarui, Jun
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.04.2020
Springer Nature B.V
Témata:
Algorithms
Complexity
Computer Science
Computing time
Integers
Special Issue on Theoretical Aspects of Computer Science
Theory of Computation
Space-efficient algorithm
Patience sorting
Longest increasing subsequence
ISSN:1432-4350, 1433-0490
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Given a sequence of integers, we want to find a longest increasing subsequence of the sequence. It is known that this problem can be solved in O n log n time and space. Our goal in this paper is to reduce the space consumption while keeping the time complexity small. For n ≤ s ≤ n , we present algorithms that use O s log n bits and O 1 s ⋅ n 2 ⋅ log n time for computing the length of a longest increasing subsequence, and O 1 s ⋅ n 2 ⋅ log 2 n time for finding an actual subsequence. We also show that the time complexity of our algorithms is optimal up to polylogarithmic factors in the framework of sequential access algorithms with the prescribed amount of space.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1432-4350
1433-0490
DOI:10.1007/s00224-018-09908-6