Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem.
Mark de BergArpan SadhukhanFrits C. R. SpieksmaPublished in: CoRR (2021)
Keyphrases
- approximation algorithms
- np hard
- special case
- minimum cost
- worst case
- vertex cover
- np hardness
- network design problem
- approximation ratio
- facility location problem
- primal dual
- approximation schemes
- precedence constraints
- open shop
- randomized algorithms
- disjoint paths
- constant factor approximation
- exact algorithms
- greedy algorithm
- scheduling problem
- lower bound
- set cover
- constant factor
- approximation guarantees
- undirected graph
- simulated annealing
- computational complexity