Approximation Algorithms for Graph Homomorphism Problems.
Michael LangbergYuval RabaniChaitanya SwamyPublished in: APPROX-RANDOM (2006)
Keyphrases
- approximation algorithms
- vertex cover
- undirected graph
- special case
- np hardness
- np hard
- minimum cost
- randomized algorithms
- disjoint paths
- approximation schemes
- exact algorithms
- optimization problems
- precedence constraints
- network design problem
- constant factor
- facility location problem
- approximation ratio
- set cover
- primal dual
- np complete
- worst case
- bipartite graph
- open shop
- constant factor approximation