Running Errands in Time: Approximation Algorithms for Stochastic Orienteering.
Anupam GuptaRavishankar KrishnaswamyViswanath NagarajanR. RaviPublished in: Math. Oper. Res. (2015)
Keyphrases
- approximation algorithms
- approximation schemes
- np hard
- special case
- vertex cover
- worst case
- minimum cost
- exact algorithms
- primal dual
- set cover
- approximation ratio
- facility location problem
- network design problem
- open shop
- constant factor
- randomized algorithms
- undirected graph
- disjoint paths
- np hardness
- precedence constraints
- polynomial time approximation
- multistage