Approximation Algorithms for Capacitated k-Travelling Repairmen Problems.
Christopher S. MartinMohammad R. SalavatipourPublished in: ISAAC (2016)
Keyphrases
- approximation algorithms
- network design problem
- vertex cover
- np hard
- facility location problem
- special case
- np hardness
- approximation schemes
- randomized algorithms
- exact algorithms
- open shop
- disjoint paths
- minimum cost
- worst case
- set cover
- error bounds
- knapsack problem
- optimization problems
- polynomial time approximation