On Two Approximation Algorithms for the Clique Problem.
Iain A. StewartPublished in: Int. J. Found. Comput. Sci. (1993)
Keyphrases
- approximation algorithms
- special case
- np hard
- minimum cost
- facility location problem
- worst case
- vertex cover
- exact algorithms
- primal dual
- open shop
- approximation ratio
- set cover
- network design problem
- np hardness
- precedence constraints
- approximation schemes
- constant factor
- single machine scheduling problem
- undirected graph
- message passing
- dynamic programming