Improvised divide and conquer approach for the LIS problem
From MaRDI portal
Recommendations
- A divide and conquer approach and a work-optimal parallel algorithm for the LIS problem
- Algorithmic approach to the split problems
- Solving large scale combinatorial optimization problems based on a divide and conquer strategy
- Randomized divide-and-conquer: improved path, matching, and packing algorithms
- Improved algorithms for path partition and related problems
- scientific article; zbMATH DE number 1444291
- Implicit and explicit algorithms for solving the split feasibility problem
- Applications of a strategy for designing divide-and-conquer algorithms
- New efficient algorithms for the LCS and constrained LCS problems
Cites work
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- A divide and conquer approach and a work-optimal parallel algorithm for the LIS problem
- An algorithm for solving the longest increasing circular subsequence problem
- Enumerating longest increasing subsequences and patience sorting
- Fast computation of a longest increasing subsequence and application
- Introduction to algorithms.
- Longest Increasing and Decreasing Subsequences
- Longest increasing subsequences in sliding windows
- Longest increasing subsequences in windows based on canonical antichain partition
- On computing the length of longest increasing subsequences
- On the longest increasing subsequence of a circular list
- Preserving order in a forest in less than logarithmic time and linear space
- The constrained longest common subsequence problem
- The longest almost-increasing subsequence
Cited in
(1)
This page was built for publication: Improvised divide and conquer approach for the LIS problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1748198)
