Improving Order with Queues

07/06/2022
by   Andreas Karrenbauer, et al.
0

Patience Sort sorts a sequence of numbers with a minimal number of queues that work according to the First-In-First-Out (FIFO) principle. More precisely, if the length of the longest descreasing subsequence of the input sequence is L, then Patience Sort uses L queues. We ask how much one can improve order with k queues, where k < L? We address this question for two measures of sortedness: number of down-steps and length of the longest descreasing subsequence. For the first measure, we give an optimal algorithm. For the second measure, we give some partial results. The research was inspired by a problem arising in car manufacturing.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/17/2018

Fast and Longest Rollercoasters

For k≥ 3, a k-rollercoaster is a sequence of numbers whose every maximal...
research
06/10/2019

On Embedding De Bruijn Sequences by Increasing the Alphabet Size

The generalization of De Bruijn sequences to infinite sequences with res...
research
08/17/2021

Arbitrary-length analogs to de Bruijn sequences

Let α be a length-L cyclic sequence of characters from a size-K alphabet...
research
08/14/2023

Sequences with identical autocorrelation spectra

Aperiodic autocorrelation measures the similarity between a finite-lengt...
research
06/07/2018

Alignment-free sequence comparison using absent words

Sequence comparison is a prerequisite to virtually all comparative genom...
research
11/26/2017

How to Measure Sessions of Mobile Device Use? Quantification, Evaluation, and Applications

Research on mobile phone use often starts with a question of "How much t...
research
02/07/2019

Significance of Episodes Based on Minimal Windows

Discovering episodes, frequent sets of events from a sequence has been a...

Please sign up or login with your details

Forgot password? Click here to reset