Approximation Algorithms for Min-Distance Problems in DAGs.
Mina DalirrooyfardJenny KaufmannPublished in: CoRR (2021)
Keyphrases
- approximation algorithms
- vertex cover
- np hard
- approximation schemes
- randomized algorithms
- exact algorithms
- special case
- worst case
- network design problem
- np hardness
- minimum cost
- open shop
- approximation ratio
- constant factor
- practical solutions
- belief networks
- optimization problems
- optimal solution
- objective function