The principle of optimality in the design of efficient algorithms
From MaRDI portal
Publication:1085609
DOI10.1016/0022-247X(86)90147-2zbMath0607.68029OpenAlexW2073706919MaRDI QIDQ1085609
Publication date: 1986
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-247x(86)90147-2
Analysis of algorithms and problem complexity (68Q25) Dynamic programming (90C39) Algorithms in computer science (68W99)
Related Items (2)
Categories, relations and dynamic programming ⋮ The application of automated reasoning to formal models of combinatorial optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Dynamic programming is optimal for certain sequential decision processes
- On the optimality of algorithms for finite state sequential decision processes
- Classes of discrete optimization problems and their decision problems
- Contribution to nonserial dynamic programming
- On the computational power of pushdown automata
- Solvable classes of discrete dynamic programming
- A Comprehensive Model of Dynamic Programming
- Dynamic Programming is Optimal for Nonserial Optimization Problems
- Minimal representations of some classes of dynamic programming
- An Extension of the String-to-String Correction Problem
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- P-Complete Approximation Problems
- `` Strong NP-Completeness Results
- Combinatorial Problems: Reductibility and Approximation
- The String-to-String Correction Problem
- Recognition and parsing of context-free languages in time n3
- Finite-State Processes and Dynamic Programming
- Necessary and Sufficient Conditions for Dynamic Programming of Combinatorial Type
This page was built for publication: The principle of optimality in the design of efficient algorithms
