Approximation algorithm for a generalized Roman domination problem in unit ball graphs.
Limin WangYalin ShiZhao ZhangZan-Bo ZhangXiaoyan ZhangPublished in: J. Comb. Optim. (2020)
Keyphrases
- dynamic programming
- high accuracy
- learning algorithm
- detection algorithm
- experimental evaluation
- times faster
- computational cost
- optimization algorithm
- significant improvement
- np hard
- k means
- optimal solution
- theoretical analysis
- graph structure
- recognition algorithm
- computational complexity
- preprocessing
- minimum spanning tree
- adjacency graph
- spanning tree
- graph clustering
- graph model
- weighted graph
- error bounds
- tree structure
- linear programming
- simulated annealing
- bayesian networks