O(f) Bi-Approximation for Capacitated Covering with Hard Capacities.

Mong-Jen Kao Hai-Lun Tu D. T. Lee

Published in: CoRR (2016)

Keyphrases

approximation algorithms
np hard
business intelligence
error bounds
network design problem
neural network
queueing networks
lot sizing
data sets
closed form
approximation error
multi item
upper approximation
vehicle routing problem