Approximation Bounds for the Minimum k-Storage Problem.
Gianlorenzo D'AngeloDaniele DiodatiAlfredo NavarraCristina M. PinottiPublished in: ALGOSENSORS (2013)
Keyphrases
- constant factor
- error bounds
- error tolerance
- approximation methods
- stage stochastic programs
- lower bound
- markovian decision
- upper bound
- monte carlo
- approximation algorithms
- worst case
- approximation error
- storage requirements
- data storage
- rate distortion theory
- tight bounds
- lower and upper bounds
- upper and lower bounds
- storage and retrieval
- closed form
- queueing networks
- relative error
- real time
- storage systems
- vc dimension
- sample complexity
- worst case analysis
- minimum cost
- square error
- computational complexity
- bayesian networks