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]

Authors

Rüdiger Reischuk

This author has not been identified. Look up 'Rüdiger Reischuk' in Google