TY - JOUR
T1 - Enumerating longest increasing subsequences and patience sorting
AU - Bespamyatnikh, Sergei
AU - Segal, Michael
N1 - Funding Information:
*Corresponding author. E-mail address: besp@cs.ubc.ca (S. Bespamyatnikh). 1Work by Michael Segal has been supported by the Institute for Mathematical Studies, Canada.
PY - 2000/11/20
Y1 - 2000/11/20
N2 - In this paper we present three algorithms that solve three combinatorial optimization problems related to each other. One of them is the patience sorting game, invented as a practical method of sorting real decks of cards. The second problem is computing the longest monotone increasing subsequence of the given sequence of n positive integers in the range 1,...,n. The third problem is to enumerate all the longest monotone increasing subsequences of the given permutation.
AB - In this paper we present three algorithms that solve three combinatorial optimization problems related to each other. One of them is the patience sorting game, invented as a practical method of sorting real decks of cards. The second problem is computing the longest monotone increasing subsequence of the given sequence of n positive integers in the range 1,...,n. The third problem is to enumerate all the longest monotone increasing subsequences of the given permutation.
UR - http://www.scopus.com/inward/record.url?scp=0034325359&partnerID=8YFLogxK
U2 - 10.1016/S0020-0190(00)00124-1
DO - 10.1016/S0020-0190(00)00124-1
M3 - Article
AN - SCOPUS:0034325359
SN - 0020-0190
VL - 76
SP - 7
EP - 11
JO - Information Processing Letters
JF - Information Processing Letters
IS - 1-2
ER -