Approximation Algorithms for Two Parallel Dedicated Machine Scheduling with Conflict Constraints.
An ZhangLiang ZhangYong ChenGuangting ChenXing WangPublished in: COCOA (2021)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- precedence constraints
- vertex cover
- network design problem
- facility location problem
- minimum cost
- primal dual
- np hardness
- approximation ratio
- exact algorithms
- open shop
- undirected graph
- approximation schemes
- mixed integer
- global constraints
- set cover
- constant factor
- combinatorial auctions
- constraint programming
- polynomial time approximation
- linear program
- scheduling problem
- disjoint paths
- integrality gap