On the Complexity of Approximation and Online Scheduling Problems with Applications to Optical Networks (Q2827800): Difference between revisions
From MaRDI portal
Latest revision as of 19:26, 12 July 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