Dynamic Approximate Matchings with an Optimal Recourse Bound.

Published in: CoRR (2018)

Keyphrases

worst case
provide an upper bound
lower bound
dynamic programming
asymptotically optimal
upper bound
optimal design
neural network
optimal control
error bounds
closed form
linear program
estimation error
optimal solution
bayesian networks
dynamically changing
stochastic programming
optimal cost
data sets