Two Approximation Algorithms for 3-Cycle Covers.
Markus BläserBodo MantheyPublished in: APPROX (2002)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- vertex cover
- minimum cost
- network design problem
- exact algorithms
- randomized algorithms
- open shop
- set cover
- facility location problem
- primal dual
- approximation ratio
- constant factor
- np hardness
- disjoint paths
- undirected graph
- learning algorithm
- mathematical model