A Tight Lower Bound for the Train Reversal Problem.
Alok AggarwalFrank Thomson LeightonPublished in: Inf. Process. Lett. (1990)
Keyphrases
- lower bound
- upper bound
- worst case
- branch and bound algorithm
- branch and bound
- np hard
- lower and upper bounds
- objective function
- upper and lower bounds
- data sets
- optimal solution
- real time
- linear programming relaxation
- vc dimension
- special case
- markov random field
- sample complexity
- search algorithm
- artificial intelligence
- genetic algorithm
- database
- branch and bound method
- sufficiently accurate