DeepAI AI Chat
Log In Sign Up

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

by   Michael Mitzenmacher, et al.

In this paper, we provide new approximation algorithms for dynamic variations of the longest increasing subsequence (LIS) problem, and the complementary distance to monotonicity (DTM) problem. In this setting, operations of the following form arrive sequentially: (i) add an element, (ii) remove an element, or (iii) substitute an element for another. At every point in time, the algorithm has an approximation to the longest increasing subsequence (or distance to monotonicity). We present a (1+ϵ)-approximation algorithm for DTM with polylogarithmic worst-case update time and a constant factor approximation algorithm for LIS with worst-case update time Õ(n^ϵ) for any constant ϵ > 0. the time the operation arrives. Our dynamic algorithm for LIS leads to an almost optimal algorithm for the Erdös-Szekeres partitioning problem. Erdös-Szekeres partitioning problem was introduced by Erdös and Szekeres in 1935 and was known to be solvable in time O(n^1.5log n). Subsequent work improve the runtime to O(n^1.5) only in 1998. Our dynamic LIS algorithm leads to a solution for Erdös-Szekeres partitioning problem with runtime Õ_ϵ(n^1+ϵ) for any constant ϵ > 0.


page 1

page 2

page 3

page 4


Improved Dynamic Algorithms for Longest Increasing Subsequence

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

Fully Dynamic Approximation of LIS in Polylogarithmic Time

We revisit the problem of maintaining the longest increasing subsequence...

Minimum-weight partitioning of a set with associated subsets

The paper presents complexity results and performance guaranties for a f...

Dynamic Approximate Shortest Paths and Beyond: Subquadratic and Worst-Case Update Time

Consider the following distance query for an n-node graph G undergoing e...

Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem

Let P be a set of points in ℝ^d, where each point p∈ P has an associated...

A Partitioning Algorithm for Detecting Eventuality Coincidence in Temporal Double recurrence

A logical theory of regular double or multiple recurrence of eventualiti...

Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm

Consider a problem where 4k given vectors need to be partitioned into k ...