"Computing a Most Probable Delay Constrained Path: NP-Hardness and ..."

Ying Xiao et al. (2012)

> Home

Details and statistics

DOI: 10.1109/TC.2011.61

access: closed

type: Journal Article

metadata version: 2022-04-09

- view
  authority control:
- export record
  dblp key:
  - journals/tc/XiaoTFYX12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tc/XiaoTFYX12
Ying Xiao, Krishnaiyan Thulasiraman, Xi Fang, Dejun Yang, Guoliang Xue:
Computing a Most Probable Delay Constrained Path: NP-Hardness and Approximation Schemes. IEEE Trans. Computers 61(5): 738-744 (2012)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.