Approximation algorithms for TTP(2).
Clemens ThielenStephan WestphalPublished in: Math. Methods Oper. Res. (2012)
Keyphrases
- approximation algorithms
- special case
- np hard
- vertex cover
- minimum cost
- worst case
- primal dual
- network design problem
- open shop
- randomized algorithms
- facility location problem
- exact algorithms
- np hardness
- approximation ratio
- constant factor
- approximation schemes
- undirected graph
- polynomial time approximation
- constant factor approximation
- optimal solution
- trusted third party
- strongly np hard
- computational complexity