Optimal Algorithms and Approximation Algorithms for Replica Placement with Distance Constraints in Tree Networks.
Anne BenoitHubert LarchevêquePaul Renaud-GoudPublished in: IPDPS (2012)
Keyphrases
- approximation algorithms
- worst case
- constant factor
- vertex cover
- randomized algorithms
- set cover
- np hard
- exact algorithms
- special case
- approximation schemes
- theoretical analysis
- minimum cost
- learning algorithm
- computational complexity
- longest common subsequence
- winner determination
- primal dual
- lower bound
- network design
- solution space
- greedy algorithm
- optimization problems
- constant factor approximation
- approximation guarantees