Exact and Approximation Algorithms for PMMS Under Identical Constraints.
Sijia DaiGuichen GaoXinru GuoYong ZhangPublished in: TAMC (2022)
Keyphrases
- approximation algorithms
- np hard
- special case
- primal dual
- vertex cover
- precedence constraints
- worst case
- facility location problem
- network design problem
- randomized algorithms
- minimum cost
- exact algorithms
- set cover
- constant factor
- scheduling problem
- open shop
- approximation schemes
- approximation ratio
- constraint programming
- strongly np hard
- undirected graph
- approximation guarantees
- constraint satisfaction problems
- polynomial time approximation
- constant factor approximation