回溯条件下背包的指数时间下界
On Exponential Time Lower Bound of Knapsack under Backtracking
摘要:
M.Aleknovich等人最近提出了一种算法模型,称为BT模型,它推广了Borodin,Nielson和Rackoff的优先级模型以及Woeginger的简单动态规划模型。BT模型又可分为固定模型、自适应模型和完全自适应模型。在自适应BT模型下,证明了背包问题精确算法和近似算法的指数时间下界。它们的精确下界是$Ω(2^{0.5n}/\sqrt{n})$,本文通过同样的技术,并对相关参数进行优化,将其精确下界稍微改进到约为$Ω(2^{0.69n}/\sqrt{n})$。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。