On Pseudodeterministic Approximation Algorithms.
Peter DixonAduri PavanN. V. VinodchandranPublished in: MFCS (2018)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- vertex cover
- minimum cost
- network design problem
- primal dual
- exact algorithms
- approximation ratio
- randomized algorithms
- set cover
- facility location problem
- approximation schemes
- np hardness
- precedence constraints
- integer programming
- disjoint paths
- constant factor
- polynomial time approximation