Exact algorithms for maximum weighted independent set on sparse graphs.
Sen HuangMingyu XiaoXiaoyu ChenPublished in: CoRR (2021)
Keyphrases
- independent set
- exact algorithms
- maximum weight
- knapsack problem
- maximum independent set
- approximation algorithms
- vehicle routing problem with time windows
- exact solution
- weighted graph
- max sat
- combinatorial optimization
- combinatorial optimization problems
- heuristic methods
- combinatorial problems
- partial order
- optimal solution
- bipartite graph
- dynamic programming
- graph theory
- branch and bound
- social network analysis
- optimal policy
- optimization problems
- upper bound
- genetic algorithm