Toward a model for backtracking and dynamic programming

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2005, Pages 308-322

  Alekhnovich, Michael ^a   Borodin, Allan ^b   Buresh Oppenheim, Joshua ^c   Impagliazzo, Russell ^c   Magen, Avner ^b   Pitassi, Toniann ^b  

^a INSTITUTE FOR ADVANCED STUDY   (United States)

^b UNIVERSITY OF TORONTO   (Canada)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BACKTRACKING ALGORITHMS; DYNAMIC PROGRAMMING MODEL;

ALGORITHMS; MATHEMATICAL MODELS; PROBLEM SOLVING;

DYNAMIC PROGRAMMING;

EID: 27644587531     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.2005.32     Document Type: Conference Paper

References (30)

1. M. Alekhnovich. More on average case vs approximation complexity. In Proc. 44th Ann. Symp. on Foundations of Computer Science, 2003.
2. M. Alekhnovich. Lower bounds for k-DNF resolution on random 3CNF. Manuscript, 2004.
3. M. Alekhnovich, A. Borodin, J. Buresh-Oppenheim, R. Impagliazzo, A. Magen, and T. Pitassi. Toward a Model for Backtracking and Dynamic Programming. http://www.cs.toronto.edu/~avner/papers/model-bt.pdf, 2004.
4. M. Alekhnovich, E. Hirsch, and D. Itsykson. Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas. In Automata, Languages and Programming: 31st International Colloquium, ICALPQ4, 2004.
5. M. Alekhnovich and A. Razborov. Lower bounds for the polynomial calculus: non-binomial case. In Proc. 42nd Ann. Symp. on Foundations of Computer Science. IEEE Computer Society, 2001.
6. S. Angelopoulos and A. Borodin. On the power of priority algorithms for facility location and set cover. In Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization, volume 2462 of Lecture Notes in Computer Science, pages 26-39. Springer-Verlag, 2002.
7. E. M. Arkin and E. L. Silverberg. Scheduling jobs with fixed start and end times. Disc. Appl. Math, 18:1-8, 1987.
8. S. Arora, B. Bollobás, and L. Lovász. Proving integrality gaps without knowing the linear program. In Proceedings of the 43rd Annual IEEE Conference on Foundations of Computer Science, pages 313-322, 2002.
9. A. Borodin, J. Boyar, and K. S. Larsen. Priority Algorithms for Graph Optimization Problems. In Second Workshop on Approximation and Online Algorithms, volume 3351 of Lecture Notes in Computer Science, pages 126-139. Springer-Verlag, 2005.
10. A. Borodin, D. Cashman, and A. Magen. How well can primal-dual and local-ratio algorithms perform? Manuscript, 2005.
11. A. Borodin, M. Nielsen, and C. Rackoff. (Incremental) priority algorithms. Algorithmica, 37:295-326, 2003.
12. J. Buresh-Oppenheim, S. Davis, and R. Impagliazzo. A formal model of dynamic programming algorithms. Manuscript in preparation, 2004.
13. V. Chvátal. Hard knapsack problems. Operations Research, 28(6):1402-1441, 1985.
14. S. Cook and D. Mitchell. Finding hard instances of the satisfiability problem: A survey. In DIMACS Series in Theoretical Computer Science, 1997.
15. T. Cormen, C. Leiserson, R. Rivest, and C. Stein. Introduction to Algorithms, Second Edition (Page 1015). MIT Press, Cambridge, Mass., 2001.
16. M. Davis, G. Logemann, and D. Loveland. A machine program for theorem proving. Commun. ACM, 5:394-397, 1962.
17. M. Davis and H. Putnam. A computing procedure for quantification theory. Commun. ACM, 7:201-215, 1960.
18. S. Davis and R. Impagliazzo. Models of greedy algorithms for graph problems. In Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, 2004.
19. B. Dean, M. Goemans, and J. Vondrak. Approximating the stochastic knapsack problem: The benefit of adaptivity. In Proc. 44th Ann. Symp. on Foundations of Computer Science, 2004.
20. T. Erlebach and F. Spieksma. Interval selection: Applications, algorithms, and lower bounds. Technical Report 752, Computer Engineering and Networks Laboratory, ETH, Oct. 2002.
21. J. Gu, P. W. Purdom, J. Franco, and B. J. Wah. Algorithms for the Satisfiability (SAT) Problem: A Survey. In Satisfiability (SAT) Problem, DIMACS, pages 19-151. American Mathematical Society, 1997.
22. M. Halldorsson, K. Iwama, S. Miyazaki, and S. Taketomi. Online independent sets. Theoretical Computer Science, pages 953-962, 2002.
23. S. Horn. One-pass algorithms with revocable acceptances for job interval selection. MSc Thesis, University of Toronto, 2004.
24. O. Ibarra and C. Kim. Fast approximation algorithms for the knapsack and sum of subset problems. JACM, 1975.
25. S. Khanna, R. Motwani, M. Sudan, and U. Vazirani. On syntactic versus computational views of approximability. SIAM Journal on Computing, 28:164-a91, 1998.
26. E. L. Lawler. Fast approximation algorithms for knapsack problems. In Proc. 18th Ann. Symp. on Foundations of Computer Science, Long Beach, CA, 1977. IEEE Computer Society.
27. A. Razborov and S. Rudich. Natural proofs. J. Compta. Syst. Sci., 55(1):24-35, 1997.
28. O. Regev. Priority algorithms for makespan minimization in the subset model. Information Processing Letters, 84(3):153-157, Septmeber 2002.
29. C. E. Shannon. The synthesis of two-terminal switching circuits. Bell Systems Tech. J., 28:59-98, 1949.
30. G. Woeginger. When does a dynamic programming formulation guarantee the existence of a fully polynomial time approximation scheme (FPTAS)? INFORMS Journal on Computing, 12:57-75, 2000.