Authors: Chalermsook, Parinya, Cygan, Marek, Kortsarz, Guy, Laekhanukit, Bundit, Manurangsi, Pasin, Nanongkai, Danupon, Trevisan, Luca
Contributors: Computer Science - Algorithms and Theoretical Computer Science (TCS), University of Warsaw, Rutgers - The State University of New Jersey, Camden, Shanghai University of Finance and Economics, University of California Berkeley, KTH Royal Institute of Technology, Department of Computer Science, Aalto-yliopisto, Aalto University
Subject Terms: hardness of approximation, parameterized complexity, subexponential-time algorithms, fine-grained complexity, clique, dominating set, DENSE K-SUBGRAPH, LOWER BOUNDS, COMPLEXITY, HARDNESS, INAPPROXIMABILITY, APPROXIMATION, PROOFS
File Description: application/pdf
Relation: SIAM JOURNAL ON COMPUTING; Volume 49, issue 4; Chalermsook , P , Cygan , M , Kortsarz , G , Laekhanukit , B , Manurangsi , P , Nanongkai , D & Trevisan , L 2020 , ' From gap-exponential time hypothesis to fixed parameter tractable inapproximability : Clique, dominating set, and more ' , SIAM JOURNAL ON COMPUTING , vol. 49 , no. 4 , pp. 772-810 . https://doi.org/10.1137/18M1166869; PURE UUID: 09f74f78-f800-4d42-9a12-c56d0dbd47c6; PURE ITEMURL: https://research.aalto.fi/en/publications/09f74f78-f800-4d42-9a12-c56d0dbd47c6; PURE LINK: http://www.scopus.com/inward/record.url?scp=85091332800&partnerID=8YFLogxK; PURE FILEURL: https://research.aalto.fi/files/51908632/Chalermsook_From_Gap_Exponential.18m1166869.pdf; https://aaltodoc.aalto.fi/handle/123456789/46935; URN:NBN:fi:aalto-202010165832
