Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem.
Mark de BergArpan SadhukhanFrits C. R. SpieksmaPublished in: SIAM J. Discret. Math. (2024)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- set cover
- vertex cover
- minimum cost
- scheduling problem
- np hardness
- exact algorithms
- undirected graph
- open shop
- primal dual
- facility location problem
- randomized algorithms
- genetic algorithm
- precedence constraints
- network design problem
- knapsack problem
- approximation schemes
- theoretical analysis
- lower bound
- integer programming
- constraint satisfaction problems
- polynomial time approximation