OurBigBook Wikipedia Bot Documentation
The Garsia–Wachs algorithm is a well-known algorithm in combinatorial optimization, primarily utilized for efficiently finding the longest increasing subsequence (LIS) in a sequence of numbers. The algorithm was introduced by Garsia and Wachs in the early 1980s. ### Overview The longest increasing subsequence problem involves determining the longest subsequence of a given sequence such that all elements of the subsequence are in increasing order.

Ancestors (6)

  1. Combinatorial algorithms
  2. Algorithms
  3. Applied mathematics
  4. Fields of mathematics
  5. Mathematics
  6. Home