Improved Dynamic Algorithms for Longest Increasing Subsequence

11/21/2020
by   Tomasz Kociumaka, et al.
0

We study dynamic algorithms for the longest increasing subsequence (LIS) problem. A dynamic LIS algorithm maintains a sequence subject to operations of the following form arriving one by one: (i) insert an element, (ii) delete an element, or (iii) substitute an element for another. After performing each operation, the algorithm must report the length of the longest increasing subsequence of the current sequence. Our main contribution is the first exact dynamic LIS algorithm with sublinear update time. More precisely, we present a randomized algorithm that performs each operation in time Õ(n^4/5) and after each update, reports the answer to the LIS problem correctly with high probability. We use several novel techniques and observations for this algorithm that may find their applications in future work. In the second part of the paper, we study approximate dynamic LIS algorithms, which are allowed to underestimate the solution size within a bounded multiplicative factor. In this setting, we give a deterministic algorithm with update time O(n^o(1)) and approximation factor 1-o(1). This result substantially improves upon the previous work of Mitzenmacher and Seddighin (STOC'20) that presents an Ω(ϵ ^O(1/ϵ))-approximation algorithm with update time Õ(n^ϵ) for any constant ϵ > 0.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/18/2021

Dynamic Longest Increasing Subsequence and the Erdös-Szekeres Partitioning Problem

In this paper, we provide new approximation algorithms for dynamic varia...
research
04/24/2018

Improved Algorithms for Fully Dynamic Maximal Independent Set

Maintaining maximal independent set in dynamic graph is a fundamental op...
research
04/09/2018

Fully Dynamic Set Cover -- Improved and Simple

In this paper, we revisit the unweighted set cover problem in the fully ...
research
08/09/2018

Longest Increasing Subsequence under Persistent Comparison Errors

We study the problem of computing a longest increasing subsequence in a ...
research
04/12/2020

Multiparty Selection

Given a sequence A of n numbers and an integer (target) parameter 1≤ i≤ ...
research
11/19/2020

Fully Dynamic Approximation of LIS in Polylogarithmic Time

We revisit the problem of maintaining the longest increasing subsequence...
research
09/11/2022

Dynamic Subset Sum with Truly Sublinear Processing Time

Subset sum is a very old and fundamental problem in theoretical computer...

Please sign up or login with your details

Forgot password? Click here to reset