Simple Approximation Algorithms for MAXNAESP and Hypergraph 2-colorability.
Daya Ram GaurRamesh KrishnamurtiPublished in: ISAAC (1999)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- vertex cover
- network design problem
- randomized algorithms
- exact algorithms
- constant factor
- open shop
- minimum cost
- primal dual
- np hardness
- facility location problem
- approximation guarantees
- single machine
- np complete
- optimal solution
- set cover
- approximation ratio
- approximation schemes
- scheduling problem