Approximating Schedules for Dynamic Graphs Efficiently

RĂ¼diger Reischuk. Approximating Schedules for Dynamic Graphs Efficiently. Electronic Colloquium on Computational Complexity (ECCC), 8(38), 2001. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.