Computing a Most Probable Delay Constrained Path: NP-Hardness and Approximation Schemes (Q5277615): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1109/tc.2011.61 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2140647291 / rank | |||
Normal rank | |||
Latest revision as of 08:32, 30 July 2024
scientific article; zbMATH DE number 6743881
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing a Most Probable Delay Constrained Path: NP-Hardness and Approximation Schemes |
scientific article; zbMATH DE number 6743881 |
Statements
Computing a Most Probable Delay Constrained Path: NP-Hardness and Approximation Schemes (English)
0 references
12 July 2017
0 references
