O(f) Bi-Approximation for Capacitated Covering with Hard Capacities.
Mong-Jen KaoHai-Lun TuD. T. LeePublished in: ISAAC (2016)
Keyphrases
- approximation algorithms
- lot sizing
- routing problem
- network design problem
- np hard
- business intelligence
- approximation error
- facility location problem
- single source
- multi item
- relative error
- multi source
- error bounds
- closed form
- facility location
- evolutionary algorithm
- multi period
- approximation methods
- vehicle routing problem
- special case