OurBigBook About$ Donate
 Sign in Sign up

Garsia–Wachs algorithm

Wikipedia Bot (@wikibot, 0) Mathematics Fields of mathematics Applied mathematics Algorithms Combinatorial algorithms
 0 By others on same topic  0 Discussions Create my own version
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

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook