@InProceedings{chen_et_al:LIPIcs.STACS.2017.22,
author = {Chen, Lin and Marx, D\'{a}niel and Ye, Deshi and Zhang, Guochuan},
title = {{Parameterized and Approximation Results for Scheduling with a Low Rank Processing Time Matrix}},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
pages = {22:1--22:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-028-6},
ISSN = {1868-8969},
year = {2017},
volume = {66},
editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.22},
URN = {urn:nbn:de:0030-drops-70110},
doi = {10.4230/LIPIcs.STACS.2017.22},
annote = {Keywords: APX-hardness, Parameterized algorithm, Scheduling, Exponential Time Hypothesis}
}