@InProceedings{bonnet_et_al:LIPIcs.STACS.2016.22,
author = {Bonnet, \'{E}douard and Lampis, Michael and Paschos, Vangelis Th.},
title = {{Time-Approximation Trade-offs for Inapproximable Problems}},
booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)},
pages = {22:1--22:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-001-9},
ISSN = {1868-8969},
year = {2016},
volume = {47},
editor = {Ollinger, Nicolas and Vollmer, Heribert},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.22},
URN = {urn:nbn:de:0030-drops-57236},
doi = {10.4230/LIPIcs.STACS.2016.22},
annote = {Keywords: Algorithm, Complexity, Polynomial and Subexponential Approximation, Reduction, Inapproximability}
}