Approximation algorithms for two-machine flow-shop scheduling with a conflict graph.
Yinhui CaiGuangting ChenYong ChenRandy GoebelGuohui LinLongcheng LiuAn ZhangPublished in: CoRR (2018)
Keyphrases
- approximation algorithms
- np hard
- special case
- minimum cost
- worst case
- vertex cover
- network design problem
- primal dual
- exact algorithms
- constant factor
- set cover
- open shop
- approximation schemes
- facility location problem
- np hardness
- approximation ratio
- undirected graph
- precedence constraints
- combinatorial auctions
- genetic algorithm