Online Markov Decoding: Lower Bounds and Near-Optimal Approximation Algorithms.
Vikas K. GargTamar PichkhadzePublished in: NeurIPS (2019)
Keyphrases
- approximation algorithms
- lower bound
- np hard
- worst case
- online algorithms
- constant factor
- upper bound
- special case
- randomized algorithms
- vertex cover
- integrality gap
- minimum cost
- facility location problem
- network design problem
- set cover
- online learning
- approximation schemes
- optimal solution
- branch and bound algorithm
- exact algorithms
- primal dual
- approximation guarantees
- average case
- branch and bound
- approximation ratio
- np hardness
- undirected graph
- markov chain
- strongly np hard
- linear programming
- disjoint paths
- objective function
- error bounds
- polynomial time approximation
- open shop
- computational complexity