Complexity and approximation algorithms for two parallel dedicated machine scheduling with conflict constraints.
An ZhangLiang ZhangYong ChenGuangting ChenXing WangPublished in: Theor. Comput. Sci. (2023)
Keyphrases
- approximation algorithms
- worst case
- np hardness
- np hard
- special case
- vertex cover
- precedence constraints
- computational complexity
- set cover
- minimum cost
- primal dual
- open shop
- randomized algorithms
- facility location problem
- approximation schemes
- network design problem
- approximation ratio
- disjoint paths
- combinatorial auctions
- upper bound
- constraint programming
- constant factor
- approximation guarantees
- polynomial time approximation
- scheduling problem
- undirected graph
- np complete
- learning algorithm
- genetic algorithm