A new upper bound for sorting permutations with prefix transpositions.
Pramod P. NairRajan SundaravaradhanBhadrachalam ChitturiPublished in: Discret. Math. Algorithms Appl. (2020)
Keyphrases
- upper bound
- lower bound
- data structure
- lower and upper bounds
- branch and bound
- upper and lower bounds
- branch and bound algorithm
- worst case
- sorting algorithms
- databases
- generalization error
- social networks
- tree structure
- np hard
- artificial neural networks
- search algorithm
- database systems
- constant factor
- neural network