Approximation Algorithms for Weighted Matching.
Shankar M. VenkatesanPublished in: Theor. Comput. Sci. (1987)
Keyphrases
- approximation algorithms
- special case
- np hard
- minimum cost
- facility location problem
- vertex cover
- worst case
- set cover
- np hardness
- matching algorithm
- open shop
- primal dual
- network design problem
- randomized algorithms
- exact algorithms
- disjoint paths
- approximation ratio
- precedence constraints
- approximation schemes
- weighted sum
- graph matching
- constant factor
- undirected graph
- polynomial time approximation
- resource allocation