Improved Linear Time Approximation Algorithms for Weighted Matchings.
Doratha E. DrakeStefan HougardyPublished in: RANDOM-APPROX (2003)
Keyphrases
- approximation algorithms
- worst case
- np hard
- special case
- vertex cover
- minimum cost
- set cover
- approximation ratio
- np hardness
- network design problem
- primal dual
- constant factor
- facility location problem
- exact algorithms
- open shop
- approximation schemes
- constant factor approximation
- disjoint paths
- precedence constraints
- undirected graph
- weighted sum
- computational complexity
- approximation guarantees
- branch and bound
- scheduling problem
- lower bound