A Stronger Model of Dynamic Programming Algorithms |
| |
Authors: | Joshua Buresh-Oppenheim Sashka Davis Russell Impagliazzo |
| |
Affiliation: | (1) Department of Computer Science, Brown University, 115 Waterman St, Providence, RI 02912, USA;(2) Department of Computer Science, University of Paderborn, Fuerstenallee 11, 33102 Paderborn, Germany;(3) Information Directorate, Air Force Research Lab, 525 Brooks Road, Rome, NY 13441, USA |
| |
Abstract: | We define a formal model of dynamic programming algorithms which we call Prioritized Branching Programs (pBP). Our model is a generalization of the BT model of Alekhnovich et al. (IEEE Conference on Computational Complexity, pp. 308–322, 2005), which is in turn a generalization of the priority algorithms model of Borodin, Nielson and Rackoff. One of the distinguishing features of these models is that they not only capture large classes of algorithms generally considered to be greedy, backtracking or dynamic programming algorithms, but they also allow characterizations of their limitations. Hence they give meaning to the statement that a given problem can or cannot be solved by dynamic programming. After defining the model, we prove three main results: (i) that certain types of natural restrictions of our seemingly more powerful model can be simulated by the BT model; (ii) that in general our model is stronger than the BT model—a fact which is witnessed by the classical shortest paths problem; (iii) that our model has very real limitations, namely that bipartite matching cannot be efficiently computed in it, hence suggesting that there are problems that can be solved efficiently by network flow algorithms and by simple linear programming that cannot be solved by natural dynamic programming approaches. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|