*Result*: On the Complexity of Approximation and Online Scheduling Problems with Applications to Optical Networks.
Title:
On the Complexity of Approximation and Online Scheduling Problems with Applications to Optical Networks.
Authors:
Source:
Graph-Theoretic Concepts in Computer Science: 41st International Workshop, WG 2015, Garching, Germany, June 17-19, 2015, Revised Papers; 2016, p31-46, 16p
Database:
Complementary Index