Approximation Algorithms for the Chromatic Sum.
Ewa M. KubickaGrzegorz KubickiDionysios KountanisPublished in: Great Lakes Computer Science Conference (1989)
Keyphrases
- approximation algorithms
- np hard
- special case
- vertex cover
- worst case
- facility location problem
- minimum cost
- primal dual
- color images
- set cover
- network design problem
- constant factor
- randomized algorithms
- polynomial time approximation
- approximation ratio
- approximation schemes
- open shop
- precedence constraints
- exact algorithms
- np hardness
- network flow
- undirected graph
- message passing
- metaheuristic
- theoretical analysis
- objective function