Login / Signup
Computing a Most Probable Delay Constrained Path: NP-Hardness and Approximation Schemes.
Ying Xiao
Krishnaiyan Thulasiraman
Xi Fang
Dejun Yang
Guoliang Xue
Published in:
IEEE Trans. Computers (2012)
Keyphrases
</>
np hardness
approximation schemes
approximation algorithms
delay constrained
np hard
multicast routing
special case
worst case
routing algorithm
bayesian networks
probability distribution
shortest path
reinforcement learning
computational complexity
multistage
bin packing