Go to the corresponding LIPIcs Volume Portal 
Bonnet, Ă‰douard ; Lampis, Michael ; Paschos, Vangelis Th.
pdfformat: 

@InProceedings{bonnet_et_al:LIPIcs:2016:5723, author = {{\'E}douard Bonnet and Michael Lampis and Vangelis Th. Paschos}, title = {{TimeApproximation Tradeoffs for Inapproximable Problems}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, pages = {22:122:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770019}, ISSN = {18688969}, year = {2016}, volume = {47}, editor = {Nicolas Ollinger and Heribert Vollmer}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2016/5723}, URN = {urn:nbn:de:0030drops57236}, doi = {10.4230/LIPIcs.STACS.2016.22}, annote = {Keywords: Algorithm, Complexity, Polynomial and Subexponential Approximation, Reduction, Inapproximability} }
Keywords:  Algorithm, Complexity, Polynomial and Subexponential Approximation, Reduction, Inapproximability  
Collection:  33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)  
Issue Date:  2016  
Date of publication:  16.02.2016 