The Complexity of Scheduling Trees with Communication Delays (Q4864438): Difference between revisions
From MaRDI portal
Removed claims |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Jan Karel Lenstra / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Bart Veltman / rank | |||
Normal rank | |||
| 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.1006/jagm.1996.0007 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2148654963 / rank | |||
Normal rank | |||
Latest revision as of 00:55, 20 March 2024
scientific article; zbMATH DE number 845872
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Complexity of Scheduling Trees with Communication Delays |
scientific article; zbMATH DE number 845872 |
Statements
The Complexity of Scheduling Trees with Communication Delays (English)
0 references
20 February 1996
0 references
minimum-length schedule
0 references
