Toward a model for backtracking and dynamic programming (Q430838): Difference between revisions

@@ Property / cites work @@
+Lower bounds for k-DNF resolution on random 3-CNFs
+Normal rank
@@ Property / cites work @@
+Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas
+Normal rank
@@ Property / cites work @@
+Lower bounds for polynomial calculus in the case of nonbinomial ideals.
+Normal rank
@@ Property / cites work @@
+The power of priority algorithms for facility location and set cover
+Normal rank
@@ Property / cites work @@
+Scheduling jobs with fixed start and end times
@@ Property / cites work: Scheduling jobs with fixed start and end times / rank @@
+Normal rank
@@ Property / cites work @@
+Q3002764
@@ Property / cites work: Q3002764 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2783476
@@ Property / cites work: Q2783476 / rank @@
+Normal rank
@@ Property / cites work @@
+(Incremental) priority algorithms
@@ Property / cites work: (Incremental) priority algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation and Online Algorithms
@@ Property / cites work: Approximation and Online Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+A stronger model of dynamic programming algorithms
+Normal rank
@@ Property / cites work @@
+Hard Knapsack Problems
@@ Property / cites work: Hard Knapsack Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4375756
@@ Property / cites work: Q4375756 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2747613
@@ Property / cites work: Q2747613 / rank @@
+Normal rank
@@ Property / cites work @@
+A machine program for theorem-proving
@@ Property / cites work: A machine program for theorem-proving / rank @@
+Normal rank
@@ Property / cites work @@
+A Computing Procedure for Quantification Theory
@@ Property / cites work: A Computing Procedure for Quantification Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Q5501284
@@ Property / cites work: Q5501284 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity
+Normal rank
@@ Property / cites work @@
+Interval selection: Applications, algorithms, and lower bounds
+Normal rank
@@ Property / cites work @@
+Q4375757
@@ Property / cites work: Q4375757 / rank @@
+Normal rank
@@ Property / cites work @@
+Online independent sets.
@@ Property / cites work: Online independent sets. / rank @@
+Normal rank
@@ Property / cites work @@
+Some optimal inapproximability results
@@ Property / cites work: Some optimal inapproximability results / rank @@
+Normal rank
@@ Property / cites work @@
+A common schema for dynamic programming and branch and bound algorithms
+Normal rank
@@ Property / cites work @@
+A Comprehensive Model of Dynamic Programming
@@ Property / cites work: A Comprehensive Model of Dynamic Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
+Normal rank
@@ Property / cites work @@
+Selecting Complementary Pairs of Literals
@@ Property / cites work: Selecting Complementary Pairs of Literals / rank @@
+Normal rank
@@ Property / cites work @@
+Finite-State Processes and Dynamic Programming
@@ Property / cites work: Finite-State Processes and Dynamic Programming / rank @@
+Normal rank
@@ Property / cites work @@
+On Syntactic versus Computational Views of Approximability
+Normal rank
@@ Property / cites work @@
+Optimum binary search trees
@@ Property / cites work: Optimum binary search trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q4171868
@@ Property / cites work: Q4171868 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4856179
@@ Property / cites work: Q4856179 / rank @@
+Normal rank
@@ Property / cites work @@
+Priority algorithms for makespan minimization in the subset model.
+Normal rank
@@ Property / cites work @@
+Applications of approximation algorithms to cooperative games
+Normal rank
@@ Property / cites work @@
+When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
+Normal rank