Approximation algorithms for stochastic orienteering.
Anupam GuptaRavishankar KrishnaswamyViswanath NagarajanR. RaviPublished in: SODA (2012)
Keyphrases
- approximation algorithms
- approximation schemes
- np hard
- special case
- vertex cover
- facility location problem
- worst case
- network design problem
- minimum cost
- primal dual
- approximation ratio
- exact algorithms
- disjoint paths
- precedence constraints
- polynomial time approximation
- np hardness
- open shop
- set cover
- constant factor
- combinatorial auctions