Fast Approximation Algorithms on Maxcut, k-Coloring, and k-Color Ordering vor VLSI Applications.
Jun Dong ChoSalil RajeMajid SarrafzadehPublished in: IEEE Trans. Computers (1998)
Keyphrases
- approximation algorithms
- np hard
- special case
- color images
- facility location problem
- vertex cover
- worst case
- open shop
- minimum cost
- primal dual
- approximation ratio
- color space
- network design problem
- set cover
- np hardness
- constant factor
- exact algorithms
- precedence constraints
- approximation schemes
- disjoint paths
- approximation guarantees
- polynomial time approximation
- partial order