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 条

[41] Generalizing partial order and dynamic backtracking
Bliek, C
FIFTEENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE (AAAI-98) AND TENTH CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICAL INTELLIGENCE (IAAI-98) - PROCEEDINGS, 1998, : 319 - 325
[42] ON RESEARCH OF OPTIMIZATION STRATEGY FOR DYNAMIC BACKTRACKING
Li, Hong-Bo
Li, Zhan-Shan
Ai, Yang
Du, Hui-Ying
PROCEEDINGS OF 2009 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-6, 2009, : 266 - +
[43] Dynamic Programming Approach toward Optimization of Workforce Planning Decisions
Fini, Alireza Ahmadian Fard
Akbarnezhad, Ali
Rashidi, Taha H.
Waller, S. Travis
JOURNAL OF CONSTRUCTION ENGINEERING AND MANAGEMENT, 2018, 144 (02)
[44] A dynamic model for processive transcription elongation and backtracking long pauses by multisubunit RNA polymerases
Xie, Ping
PROTEINS-STRUCTURE FUNCTION AND BIOINFORMATICS, 2012, 80 (08) : 2020 - 2034
[45] Selective Backtracking of Model Changes
Groher, Iris
Egyed, Alexander
2009 31ST INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING, COMPANION VOLUME, 2009, : 231 - 234
[46] TOWARD A GROWTH-ORIENTED MODEL OF FINANCIAL PROGRAMMING
CHAND, SK
WORLD DEVELOPMENT, 1989, 17 (04) : 473 - 490
[47] Toward a programming model for service-oriented computing
Curbera, F
Ferguson, D
Nally, M
Stockton, ML
SERVICE-ORIENTED COMPUTING - ICSOC 2005, PROCEEDINGS, 2005, 3826 : 33 - 47
[48] Programming pearl - Enhancing a search algorithm to perform intelligent backtracking
Bruynooghe, M
THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2004, 4 : 371 - 380
[49] Backtracking in independent and-parallel implementations of logic programming languages
Pontelli, E
Gupta, G
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2001, 12 (11) : 1169 - 1189
[50] Toward a dynamic topographic components model
Achim, A
Bouchard, S
ELECTROENCEPHALOGRAPHY AND CLINICAL NEUROPHYSIOLOGY, 1997, 103 (03): : 381 - 385

← 1 2 3 4 5 →