Login / Signup
Using Minimum Path Cover to Boost Dynamic Programming on DAGs: Co-linear Chaining Extended.
Anna Kuosmanen
Topi Paavilainen
Travis Gagie
Rayan Chikhi
Alexandru I. Tomescu
Veli Mäkinen
Published in:
RECOMB (2018)
Keyphrases
</>
dynamic programming
directed acyclic graph
state space
piecewise linear
closed form
markov decision processes
greedy algorithm
minimum cost
real time
decision trees
linear programming
shortest path
single machine
approximation algorithms
global minimum