Improved approximation algorithms for bounded-degree local Hamiltonians.
Anurag AnshuDavid GossetKaren J. Morenz KorolMehdi SoleimanifarPublished in: CoRR (2021)
Keyphrases
- approximation algorithms
- np hard
- special case
- minimum cost
- vertex cover
- worst case
- set cover
- constant factor
- facility location problem
- primal dual
- randomized algorithms
- approximation ratio
- precedence constraints
- open shop
- undirected graph
- bounded degree
- graph theoretic
- bounded treewidth
- learning algorithm
- convex hull
- np complete
- query processing