Lower Bounds on Dynamic Programming for Maximum Weight Independent Set.
Tuukka KorhonenPublished in: CoRR (2021)
Keyphrases
- independent set
- lower bound
- maximum weight
- dynamic programming
- np hard
- upper bound
- bipartite graph
- minimum weight
- maximum independent set
- objective function
- state space
- greedy algorithm
- partial order
- worst case
- single machine
- knapsack problem
- vc dimension
- randomized algorithm
- optimal solution
- reinforcement learning
- weighted graph
- multi dimensional
- scheduling problem
- learning algorithm
- online algorithms
- competitive ratio