Adam Kurpisz, Monaldo Mastrolilli, Georgios Stamoulis. Competitive-Ratio Approximation Schemes for Makespan Scheduling Problems. In Thomas Erlebach, Giuseppe Persiano, editors, Approximation and Online Algorithms - 10th International Workshop, WAOA 2012, Ljubljana, Slovenia, September 13-14, 2012, Revised Selected Papers. Volume 7846 of Lecture Notes in Computer Science, pages 159-172, Springer, 2012. [doi]
@inproceedings{KurpiszMS12,
title = {Competitive-Ratio Approximation Schemes for Makespan Scheduling Problems},
author = {Adam Kurpisz and Monaldo Mastrolilli and Georgios Stamoulis},
year = {2012},
doi = {10.1007/978-3-642-38016-7_14},
url = {http://dx.doi.org/10.1007/978-3-642-38016-7_14},
researchr = {https://researchr.org/publication/KurpiszMS12},
cites = {0},
citedby = {0},
pages = {159-172},
booktitle = {Approximation and Online Algorithms - 10th International Workshop, WAOA 2012, Ljubljana, Slovenia, September 13-14, 2012, Revised Selected Papers},
editor = {Thomas Erlebach and Giuseppe Persiano},
volume = {7846},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-38015-0},
}