Approximation algorithms and hardness results for labeled connectivity problems.
Refael HassinJérôme MonnotDanny SegevPublished in: J. Comb. Optim. (2007)
Keyphrases
- approximation algorithms
- np hardness
- vertex cover
- np hard
- worst case
- randomized algorithms
- np complete
- approximation schemes
- network design problem
- special case
- exact algorithms
- minimum cost
- facility location problem
- training data
- mixed integer programming
- computational complexity
- practical problems
- approximation ratio
- set cover
- constraint satisfaction problems
- training set
- optimal solution