Optimal harmonic period assignment: complexity results and approximation algorithms.
Morteza MohaqeqiMitra NasriYang XuAnton CervinKarl-Erik ÅrzénPublished in: Real Time Syst. (2018)
Keyphrases
- approximation algorithms
- worst case
- minimum cost
- np hardness
- np hard
- constant factor
- special case
- upper bound
- lower bound
- set cover
- vertex cover
- error bounds
- approximation schemes
- greedy algorithm
- facility location problem
- disjoint paths
- primal dual
- optimal solution
- network design problem
- strongly np hard
- dynamic programming
- approximation ratio
- combinatorial auctions
- approximation guarantees
- randomized algorithms
- search algorithm