Approximation algorithms for the arc orienteering problem.
Damianos GavalasCharalampos KonstantopoulosKonstantinos MastakasGrammati E. PantziouNikolaos VathisPublished in: Inf. Process. Lett. (2015)
Keyphrases
- approximation algorithms
- special case
- np hard
- facility location problem
- worst case
- network design problem
- approximation ratio
- vertex cover
- exact algorithms
- approximation schemes
- primal dual
- precedence constraints
- constant factor
- randomized algorithms
- open shop
- minimum cost
- genetic algorithm
- set cover
- undirected graph
- np hardness