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 条

[31] A Stronger Model of Dynamic Programming Algorithms
Buresh-Oppenheim, Joshua
Davis, Sashka
Impagliazzo, Russell
ALGORITHMICA, 2011, 60 (04) : 938 - 968
[32] A Stronger Model of Dynamic Programming Algorithms
Joshua Buresh-Oppenheim
Sashka Davis
Russell Impagliazzo
Algorithmica, 2011, 60 : 938 - 968
[33] Multiple Model Robust Dynamic Programming
Whitman, Eric C.
Atkeson, Christopher G.
2012 AMERICAN CONTROL CONFERENCE (ACC), 2012, : 5998 - 6004
[34] Dynamic ordering for asynchronous backtracking on DisCSPs
Zivan, R
Meisels, A
PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING - CP 2005, PROCEEDINGS, 2005, 3709 : 32 - 46
[35] AN EXERCISE IN TRANSFORMATIONAL PROGRAMMING - BACKTRACKING AND BRANCH-AND-BOUND
FOKKINGA, MM
SCIENCE OF COMPUTER PROGRAMMING, 1991, 16 (01) : 19 - 48
[36] BDL - A nondeterministic data flow programming language with backtracking
Schurr, A
1997 IEEE SYMPOSIUM ON VISUAL LANGUAGES, PROCEEDINGS, 1997, : 394 - 401
[37] BACKTRACKING WITH MULTILEVEL DYNAMIC SEARCH REARRANGEMENT
PURDOM, PW
BROWN, CA
ROBERTSON, EL
ACTA INFORMATICA, 1981, 15 (02) : 99 - 113
[38] Dynamic Ordering for Asynchronous Backtracking on DisCSPs
Roie Zivan
Amnon Meisels
Constraints, 2006, 11 : 179 - 197
[39] Dynamic Backtracking for Distributed Constraint Optimization
Ezzahir, Redouane
Bessiere, Christian
Benelallam, Imade
Bouyakhf, El Houssine
Belaissaoui, Mustapha
ECAI 2008, PROCEEDINGS, 2008, 178 : 901 - 902
[40] Dynamic 2-connectivity with backtracking
La Poutre, JA
Westbrook, J
SIAM JOURNAL ON COMPUTING, 1998, 28 (01) : 10 - 26

← 1 2 3 4 5 →