On Exponential Time Lower Bound of Knapsack under Backtracking
| dc.creator | Li, Xin | |
| dc.creator | Liu, Tian | |
| dc.date | 2007-12-20 | |
| dc.date | 2007-12-25 | |
| dc.date.accessioned | 2026-07-07T08:50:58Z | |
| dc.date.available | 2026-07-07T08:50:58Z | |
| dc.description | M.Aleknovich et al. have recently proposed a model of algorithms, called BT model, which generalizes both the priority model of Borodin, Nielson and Rackoff, as well as a simple dynamic programming model by Woeginger. BT model can be further divided into three kinds of fixed, adaptive and fully adaptive ones. They have proved exponential time lower bounds of exact and approximation algorithms under adaptive BT model for Knapsack problem. Their exact lower bound is $Ω(2^{0.5n}/\sqrt{n})$, in this paper, we slightly improve the exact lower bound to about $Ω(2^{0.69n}/\sqrt{n})$, by the same technique, with related parameters optimized. | |
| dc.description | This paper supersedes the result of arXiv:cs/0606064 | |
| dc.identifier | https://arxiv.org/abs/0712.3348 | |
| dc.identifier | http://arxiv.org/abs/0712.3348 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/144780 | |
| dc.subject | Computational Complexity | |
| dc.title | On Exponential Time Lower Bound of Knapsack under Backtracking | |
| dc.type | text |