An Approximation Algorithm for the H-Prize-Collecting Power Cover Problem.
Han DaiWeidong LiXiaofei LiuPublished in: FAW (2022)
Keyphrases
- prize collecting
- learning algorithm
- np hard
- detection algorithm
- objective function
- error bounds
- k means
- linear programming
- simulated annealing
- computational efficiency
- dynamic programming
- cost function
- computational complexity
- genetic algorithm
- worst case
- neural network
- expectation maximization
- ant colony optimization
- evolutionary algorithm
- power consumption
- approximation ratio
- polynomial time approximation
- error tolerance