Approximation Algorithms for Min-Distance Problems in DAGs.
Mina DalirrooyfardJenny KaufmannPublished in: ICALP (2021)
Keyphrases
- approximation algorithms
- vertex cover
- np hard
- np hardness
- special case
- network design problem
- approximation schemes
- worst case
- exact algorithms
- randomized algorithms
- primal dual
- precedence constraints
- minimum cost
- undirected graph
- facility location problem
- learning algorithm
- combinatorial auctions
- partial order
- objective function