Classical and quantum bounded depth approximation algorithms.
Matthew B. HastingsPublished in: Quantum Inf. Comput. (2019)
Keyphrases
- constant factor
- approximation algorithms
- quantum computation
- special case
- np hard
- quantum mechanics
- worst case
- vertex cover
- network design problem
- facility location problem
- minimum cost
- primal dual
- open shop
- randomized algorithms
- approximation ratio
- depth map
- set cover
- exact algorithms
- np hardness
- approximation schemes
- precedence constraints
- disjoint paths
- evolutionary algorithm