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]

Abstract

Abstract is missing.