Approximating the longest path length of a stochastic DAG by a normal distribution in linear time.
Ei AndoToshio NakataMasafumi YamashitaPublished in: J. Discrete Algorithms (2009)
Keyphrases
- normal distribution
- random variables
- directed acyclic graph
- standard deviation
- distribution free
- probability density function
- minimum length
- covariance matrix
- probability distribution
- score distributions
- gaussian distribution
- worst case
- lagrange interpolation
- image reconstruction
- lead time
- graphical models
- supply chain
- decision making