DeepAI AI Chat
Log In Sign Up

Fully Dynamic Approximation of LIS in Polylogarithmic Time

11/19/2020
by   Paweł Gawrychowski, et al.
0

We revisit the problem of maintaining the longest increasing subsequence (LIS) of an array under (i) inserting an element, and (ii) deleting an element of an array. In a recent breakthrough, Mitzenmacher and Seddighin [STOC 2020] designed an algorithm that maintains an 𝒪((1/ϵ)^𝒪(1/ϵ))-approximation of LIS under both operations with worst-case update time Õ(n^ϵ), for any constant ϵ>0. We exponentially improve on their result by designing an algorithm that maintains an (1+ϵ)-approximation of LIS under both operations with worst-case update time Õ(ϵ^-5). Instead of working with the grid packing technique introduced by Mitzenmacher and Seddighin, we take a different approach building on a new tool that might be of independent interest: LIS sparsification. A particularly interesting consequence of our result is an improved solution for the so-called Erdős-Szekeres partitioning, in which we seek a partition of a given permutation of {1,2,…,n} into 𝒪(√(n)) monotone subsequences. This problem has been repeatedly stated as one of the natural examples in which we see a large gap between the decision-tree complexity and algorithmic complexity. The result of Mitzenmacher and Seddighin implies an 𝒪(n^1+ϵ) time solution for this problem, for any ϵ>0. Our algorithm (in fact, its simpler decremental version) further improves this to Õ(n).

READ FULL TEXT

page 1

page 2

page 3

page 4

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...
02/08/2023

Fully-Dynamic Approximate Decision Trees With Worst-Case Update Time Guarantees

We give the first algorithm that maintains an approximate decision tree ...
11/17/2017

Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms

We present a simple randomized reduction from fully-dynamic integral mat...
11/21/2020

Improved Dynamic Algorithms for Longest Increasing Subsequence

We study dynamic algorithms for the longest increasing subsequence (LIS)...
05/05/2020

The Expander Hierarchy and its Applications to Dynamic Graph Algorithms

We introduce a notion for hierarchical graph clustering which we call th...
08/24/2022

A Simpler Proof that Pairing Heaps Take O(1) Amortized Time per Insertion

The pairing heap is a simple "self-adjusting" implementation of a heap (...
01/07/2019

An in-place, subquadratic algorithm for permutation inversion

We assume the permutation π is given by an n-element array in which the ...