Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2017.22
URN: urn:nbn:de:0030-drops-70110
URL: https://drops.dagstuhl.de/opus/volltexte/2017/7011/
Chen, Lin ; Marx, Dániel ; Ye, Deshi ; Zhang, Guochuan
Parameterized and Approximation Results for Scheduling with a Low Rank Processing Time Matrix
| pdf-format: |
|
Abstract
We study approximation and parameterized algorithms for R||C_max, focusing on the problem when the rank of the matrix formed by job processing times is small. Bhaskara et al. initiated the study of approximation algorithms with respect to the rank, showing that R||C_max admits a QPTAS (Quasi-polynomial time approximation scheme) when the rank is 2, and becomes APX-hard when the rank is 4.We continue this line of research. We prove that R||C_max is APX-hard even if the rank is 3, resolving an open problem. We then show that R||C_max is FPT parameterized by the rank and the largest job processing time p_max. This generalizes the parameterized results on P||C_max and R||C_max with few different types of machines. We also provide nearly tight lower bounds under Exponential Time Hypothesis which suggests that the running time of the FPT algorithm is unlikely to be improved significantly.
BibTeX - Entry
@InProceedings{chen_et_al:LIPIcs:2017:7011,
author = {Lin Chen and D{\'a}niel Marx and Deshi Ye and Guochuan Zhang},
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 = {Heribert Vollmer and Brigitte Vallée},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2017/7011},
URN = {urn:nbn:de:0030-drops-70110},
doi = {10.4230/LIPIcs.STACS.2017.22},
annote = {Keywords: APX-hardness, Parameterized algorithm, Scheduling, Exponential Time Hypothesis}
}
| Keywords: | APX-hardness, Parameterized algorithm, Scheduling, Exponential Time Hypothesis | |
| Seminar: | 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017) | |
| Issue date: | 2017 | |
| Date of publication: | 06.03.2017 |
