TOWARD A MODEL FOR BACKTRACKING AND DYNAMIC PROGRAMMING

被引：10

作者：

Alekhnovich, Michael ^{[1
]}

Borodin, Allan ^{[2
]}

Buresh-Oppenheim, Joshua ^{[3
]}

Impagliazzo, Russell ^{[1
,4
]}

Magen, Avner ^{[2
]}

Pitassi, Toniann ^{[2
]}

机构：

[1] Inst Adv Study, Sch Math, Princeton, NJ 08540 USA

[2] Univ Toronto, Dept Comp Sci, Toronto, ON, Canada

[3] Akamai Technol, Cambridge, MA USA

[4] Univ Calif San Diego, CSE Dept, San Diego, CA 92103 USA

来源：

COMPUTATIONAL COMPLEXITY | 2011年 / 20卷 / 04期

基金：

加拿大自然科学与工程研究理事会; 美国国家科学基金会;

关键词：

Greedy algorithms; dynamic programming; models of computation; lower bounds; PRIORITY ALGORITHMS; TIME;

D O I：

10.1007/s00037-011-0028-y

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We propose a model called priority branching trees (pBT) for backtracking and dynamic programming algorithms. Our model generalizes both the priority model of Borodin, Nielson and Rackoff, as well as a simple dynamic programming model due to Woeginger, and hence spans a wide spectrum of algorithms. After witnessing the strength of the model, we then show its limitations by providing lower bounds for algorithms in this model for several classical problems such as Interval Scheduling, Knapsack and Satisfiability.

引用

页码：679 / 740

页数：62

共 50 条

[1] Toward a model for backtracking and dynamic programming
Alekhnovich, M
Borodin, A
Buresh-Oppenheim, J
Impagliazzo, R
Magen, A
Pitassi, T
TWENTIETH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2005, : 308 - 322
[2] Toward a Model for Backtracking and Dynamic Programming
Michael Alekhnovich
Allan Borodin
Joshua Buresh-Oppenheim
Russell Impagliazzo
Avner Magen
Toniann Pitassi
computational complexity, 2011, 20 : 679 - 740
[3] A Method of Motif Mining Based on Backtracking and Dynamic Programming
Song, Xiaoli
Zhou, Changjun
Wang, Bin
Zhang, Qiang
MULTI-DISCIPLINARY TRENDS IN ARTIFICIAL INTELLIGENCE, MIWAI 2015, 2015, 9426 : 317 - 328
[4] Backtracking for More Efficient Large Scale Dynamic Programming
Tripp, Charles
Shachter, Ross
2012 11TH INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND APPLICATIONS (ICMLA 2012), VOL 1, 2012, : 338 - 343
[5] Dynamic Backtracking
Ginsberg, Matthew L.
JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 1993, 1 : 25 - 46
[6] Backtracking-based dynamic programming for resolving transmit ambiguities in WSN localization
Schlupkothen, Stephan
Prasse, Bastian
Ascheid, Gerd
EURASIP JOURNAL ON ADVANCES IN SIGNAL PROCESSING, 2018,
[7] Backtracking-based dynamic programming for resolving transmit ambiguities in WSN localization
Stephan Schlupkothen
Bastian Prasse
Gerd Ascheid
EURASIP Journal on Advances in Signal Processing, 2018
[8] Toward a unified implementation for dynamic programming
Zheng, Yujun
Shi, Haihe
Xue, Jinyun
High Technology Letters, 2006, 12 (SUPPL.) : 34 - 39
[9] Toward the Concept of Backtracking Computation
Kulas, Marija
ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2005, 128 (01) : 39 - 59
[10] Greedy backtracking based local dynamic programming for complete 0-1 knapsack problem
He K.
Ren S.
Guo Z.
Qiu T.
Huazhong Keji Daxue Xuebao (Ziran Kexue Ban)/Journal of Huazhong University of Science and Technology (Natural Science Edition), 2024, 52 (02): : 16 - 21

← 1 2 3 4 5 →