An (18/11)n upper bound for sorting by prefix reversals.
Bhadrachalam ChitturiWilliam FahleZ. MengLinda MoralesCharles O. Shields Jr.Ivan Hal SudboroughWalter VoitPublished in: Theor. Comput. Sci. (2009)
Keyphrases
- upper bound
- lower bound
- data structure
- worst case
- upper and lower bounds
- branch and bound algorithm
- lower and upper bounds
- branch and bound
- database
- error probability
- constant factor
- sample complexity
- sorting algorithms
- single item
- generalization error
- mobile robot
- optimal solution
- similarity measure
- social networks
- search engine
- neural network