Randomized and Approximation Algorithms for Blue-Red Matching.
Christos NomikosAris PagourtzisStathis ZachosPublished in: MFCS (2007)
Keyphrases
- approximation algorithms
- randomized algorithms
- np hard
- special case
- worst case
- minimum cost
- vertex cover
- network design problem
- primal dual
- approximation ratio
- facility location problem
- approximation schemes
- lower bound
- disjoint paths
- exact algorithms
- constant factor
- open shop
- set cover
- graph matching
- precedence constraints
- learning algorithm