pdf-format: |
|
@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 |