Proof of the 4/3 conjecture for preemptive vs. nonpreemptive two-processor scheduling
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Proof of the 4/3 conjecture for preemptive vs. nonpreemptive two-processor scheduling
Journal of the ACM (JACM)
Algorithms with limited number of preemptions for scheduling on parallel machines
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
Algorithms with limited number of preemptions for scheduling on parallel machines
Journal of Combinatorial Optimization
Hi-index | 0.00 |