Login / Signup

Capacitated Dynamic Programming: Faster Knapsack and Graph Algorithms.

Kyriakos AxiotisChristos Tzamos
Published in: ICALP (2019)
Keyphrases
  • dynamic programming
  • graph theory
  • worst case
  • highly efficient
  • learning algorithm
  • data structure
  • graph structures
  • np hard
  • optimization problems
  • random walk
  • knapsack problem
  • graph representation
  • memory efficient