Toward a Model for Backtracking and Dynamic Programming

Authors:
Michael Alekhnovich;Allan Borodin;Joshua Buresh-Oppenheim;Russell Impagliazzo;Avner Magen;Toniann Pitassi
Affiliations:
Institute for Advanced Study in Princeton;University of Toronto;University of California at San Diego;University of California at San Diego and Institute for Advanced Study in Princeton;University of Toronto;University of Toronto and Institute for Advanced Study in Princeton
Venue:
CCC '05 Proceedings of the 20th Annual IEEE Conference on Computational Complexity
Year:
2005

Citing 0
Cited 11

Lower bounds for k-DNF resolution on random 3-CNFs

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas

Journal of Automated Reasoning
Fully polynomial time approximation schemes for stochastic dynamic programs

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Applying practice to theory

ACM SIGACT News
Priority algorithms for graph optimization problems

Theoretical Computer Science
Formula Caching in DPLL

ACM Transactions on Computation Theory (TOCT)
Note: On exponential time lower bound of Knapsack under backtracking

Theoretical Computer Science
Improved exponential time lower bound of Knapsack problem under BT model

TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Randomized priority algorithms

Theoretical Computer Science
How well can primal-dual and local-ratio algorithms perform?

ACM Transactions on Algorithms (TALG)
Further reflections on a theory for basic algorithms

AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a model (BT) for backtracking 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 andsatisfiability.