Pandora Box Problem with Nonobligatory Inspection: Hardness and Improved Approximation Algorithms.
Hu FuJiawei LiDaogao LiuPublished in: CoRR (2022)
Keyphrases
- approximation algorithms
- np hard
- worst case
- np hardness
- special case
- vertex cover
- minimum cost
- facility location problem
- primal dual
- open shop
- randomized algorithms
- network design problem
- exact algorithms
- set cover
- constant factor
- linear program
- computational complexity
- approximation schemes
- precedence constraints
- approximation ratio
- np complete
- optimal solution
- integer programming
- branch and bound algorithm
- error bounds
- information theoretic
- polynomial time approximation
- search algorithm