Capacitated Dynamic Programming: Faster Knapsack and Graph Algorithms.
Kyriakos AxiotisChristos TzamosPublished in: CoRR (2018)
Keyphrases
- dynamic programming
- graph theory
- learning algorithm
- np hard
- state space
- structured data
- greedy heuristic
- planar graphs
- optimization problems
- computationally demanding
- markov decision processes
- knapsack problem
- depth first search
- greedy algorithm
- maximum weight
- random graphs
- graph representation
- highly efficient
- combinatorial optimization
- random walk
- optimal solution
- social networks