A subexponential upper bound for the on-line chain partitioning problem.
Bartlomiej BosekTomasz KrawczykPublished in: Comb. (2015)
Keyphrases
- upper bound
- lower bound
- worst case
- branch and bound algorithm
- upper and lower bounds
- lower and upper bounds
- graph partitioning
- real world
- error probability
- sample complexity
- branch and bound
- knowledge base
- information systems
- mobile robot
- np hard
- query processing
- markov random field
- expert systems
- case study
- decision making
- genetic algorithm
- single item
- database