Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times - A Polymatroid Optimization Approach

Natalia V. Shakhlevich, Akiyoshi Shioura, Vitaly A. Strusevich. Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times - A Polymatroid Optimization Approach. In Dan Halperin, Kurt Mehlhorn, editors, Algorithms - ESA 2008, 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008. Proceedings. Volume 5193 of Lecture Notes in Computer Science, pages 756-767, Springer, 2008. [doi]

Abstract

Abstract is missing.