On the Complexity of Approximation and Online Scheduling Problems with Applications to Optical Networks (Q2827800): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 19:46, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Complexity of Approximation and Online Scheduling Problems with Applications to Optical Networks |
scientific article |
Statements
On the Complexity of Approximation and Online Scheduling Problems with Applications to Optical Networks (English)
0 references
21 October 2016
0 references
