Yair Bartal, Stefano Leonardi, Gil Shallom, René Sitters. On the Value of Preemption in Scheduling. In Josep Díaz, Klaus Jansen, José D. P. Rolim, Uri Zwick, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and 10th International Workshop on Randomization and Compu. Volume 4110 of Lecture Notes in Computer Science, pages 39-48, Springer, 2006. [doi]
@inproceedings{BartalLSS06,
title = {On the Value of Preemption in Scheduling},
author = {Yair Bartal and Stefano Leonardi and Gil Shallom and René Sitters},
year = {2006},
doi = {10.1007/11830924_6},
url = {http://dx.doi.org/10.1007/11830924_6},
researchr = {https://researchr.org/publication/BartalLSS06},
cites = {0},
citedby = {0},
pages = {39-48},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and 10th International Workshop on Randomization and Compu},
editor = {Josep Díaz and Klaus Jansen and José D. P. Rolim and Uri Zwick},
volume = {4110},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-38044-2},
}