Computing a Most Probable Delay Constrained Path: NP-Hardness and Approximation Schemes

[摘要]：Delay constrained path selection is concerned with finding a source-to-destination path so that the delay of the path is within a given delay bound. When the network is modeled by a directed graph where the delay of a link is a random variable with a know

[全文传递流程]：

一般上传文献全文的时限在1个工作日内