Safe and Complete Algorithms for Dynamic Programming Problems, with an Application to RNA Folding.
Niko KiiralaLeena SalmelaAlexandru I. TomescuPublished in: CPM (2019)
Keyphrases
- dynamic programming
- optimization problems
- benchmark problems
- run times
- test problems
- worst case
- exact and approximate
- computational problems
- orders of magnitude
- approximate solutions
- difficult problems
- problems in computer vision
- learning algorithm
- search methods
- theoretical analysis
- np hard problems
- search algorithm
- dynamic programming algorithms
- specific problems
- theoretical guarantees
- evolutionary algorithm
- machine learning
- related problems
- computational biology
- graph theory
- machine learning algorithms
- computationally efficient
- linear programming
- computational cost
- computational complexity