Improved Approximation Algorithm for Minimum Weight k-Subgraph Cover Problem.
Pengcheng LiuXiaohui HuangZhao ZhangPublished in: COCOA (2019)
Keyphrases
- minimum weight
- learning algorithm
- search space
- cost function
- dynamic programming
- optimal solution
- randomized algorithm
- np hard
- simulated annealing
- maximum weight
- greedy heuristic
- spanning tree
- tree structure
- probabilistic model
- collaborative filtering
- frequent patterns
- traveling salesman problem
- approximation algorithms
- special case
- minimum spanning tree
- lower bound
- computational complexity
- objective function
- genetic algorithm