-Approximation Algorithms for Constrained Routing.
Fernando A. KuipersAriel OrdaDanny RazPiet Van MieghemPublished in: Networking (2006)
Keyphrases
- approximation algorithms
- np hard
- special case
- vertex cover
- minimum cost
- facility location problem
- worst case
- approximation ratio
- shortest path
- primal dual
- set cover
- exact algorithms
- np hardness
- precedence constraints
- open shop
- network design problem
- routing problem
- routing algorithm
- strongly np hard
- routing protocol
- approximation schemes
- optimal solution
- constant factor