Approximation Algorithms for Two-Machine Flow-Shop Scheduling with a Conflict Graph.
Yinhui CaiGuangting ChenYong ChenRandy GoebelGuohui LinLongcheng LiuAn ZhangPublished in: COCOON (2018)
Keyphrases
- approximation algorithms
- np hard
- special case
- vertex cover
- minimum cost
- worst case
- primal dual
- set cover
- exact algorithms
- precedence constraints
- open shop
- approximation ratio
- np hardness
- network design problem
- undirected graph
- combinatorial auctions
- facility location problem
- constant factor
- approximation schemes
- polynomial time approximation
- integer programming
- upper bound
- constant factor approximation