On Hardness of Approximating the Parameterized Clique Problem
Saved in:
| Published in | Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science |
|---|---|
| Format | Conference Proceeding |
| Language | English |
| Online Access | Get full text |
| DOI | 10.1145/2840728.2840733 |
Cover
| BookMark | eNotjz1PwzAURT3AAIWZ1X8gxV-JXwaGKgKKVKkMMEfP8QtESpzgpIL21zdApnN1h6t7rtlF6AMxdifFWkqT3iswwipY_1HrK_awD3yL0QcaR97XfDMMsf9pOpya8MGnT-KvGLGjiWJzIs-Ltvk6zGXsXUvdDbussR3pduGKvT89vhXbZLd_fik2uwRVBlPitZdQW1XlKhUGrPB5JpRymRFABqrUeAdAhOCFTXNVIVnranCUzhmVXjHxv3sIAx6_sW3LIc4n47GUovw1KxezcjHTZ0YXSAE |
|---|---|
| ContentType | Conference Proceeding |
| DBID | ADTOC UNPAY |
| DOI | 10.1145/2840728.2840733 |
| DatabaseName | Unpaywall for CDI: Periodical Content Unpaywall |
| Database_xml | – sequence: 1 dbid: UNPAY name: Unpaywall url: https://proxy.k.utb.cz/login?url=https://unpaywall.org/ sourceTypes: Open Access Repository |
| DeliveryMethod | fulltext_linktorsrc |
| ExternalDocumentID | 10.1145/2840728.2840733 |
| GroupedDBID | ADTOC UNPAY |
| ID | FETCH-LOGICAL-a268t-d3d18f72c92504870d96022b6408e48c54db88eea8d07592cae77bf8be52caa23 |
| IEDL.DBID | UNPAY |
| IngestDate | Thu Aug 28 11:31:17 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-a268t-d3d18f72c92504870d96022b6408e48c54db88eea8d07592cae77bf8be52caa23 |
| OpenAccessLink | https://proxy.k.utb.cz/login?url=https://dl.acm.org/doi/pdf/10.1145/2840728.2840733 |
| ParticipantIDs | unpaywall_primary_10_1145_2840728_2840733 |
| PublicationTitle | Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science |
| Score | 1.6372268 |
| SourceID | unpaywall |
| SourceType | Open Access Repository |
| Title | On Hardness of Approximating the Parameterized Clique Problem |
| URI | https://dl.acm.org/doi/pdf/10.1145/2840728.2840733 |
| UnpaywallVersion | publishedVersion |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlZ1NS8NAEIaH2h7Ei4oVFZU9ePGQmm42m92Dh1IsRbD2YKGewn5FxJiWmqL217vTxiripafksCxhhp2ZMPs-A3AhdcINTWQglJKBj34uQOqcD4YmDBWNjHEocL4b8P6I3Y7jcQ3otxbG5n6f12ULH8_01GYV0Da-8oE0TKhoLZ9RtAUNjk2lOjRGg2HnseL2_LNyB7bnxVR9vqs8_5U8ersrQd_bkjmId0ZeWvNSt8ziD5Fxs-_ag-aPWI8M12loH2quOIDr-4JgUx4DGZlkpIPo8I9nLE-LJ-KLPjJUeC0LSc0LZ0k3R44r7oPjZZow6t08dPtBNSkhUJSLMrCRbYssoUYikcwfQet_TCjVnIXCMWFiZrUQzilhfYkgqVEuSXQmtIv9u3fJIdSLSeGOgFgmlPeYZDLjrG20kjhxKuFti8WdUMdwuTZmOl0RMdKVujlOK1OklSlONlh7CvVyNndnPsWX-rzy6RdeD6K1 |
| linkProvider | Unpaywall |
| linkToUnpaywall | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlZ1NS8NAEIaH2h7Ei4oVFZU9ePGQmm42m92Dh1IsRbD2YKGewn5FxJiWmqL217vTxiripafksCxhhp2ZMPs-A3AhdcINTWQglJKBj34uQOqcD4YmDBWNjHEocL4b8P6I3Y7jcQ3otxbG5n6f12ULH8_01GYV0Da-8oE0TKhoLZ9RtAUNjk2lOjRGg2HnseL2_LNyB7bnxVR9vqs8_5U8ersrQd_bkjmId0ZeWvNSt8ziD5Fxs-_ag-aPWI8M12loH2quOIDr-4JgUx4DGZlkpIPo8I9nLE-LJ-KLPjJUeC0LSc0LZ0k3R44r7oPjZZow6t08dPtBNSkhUJSLMrCRbYssoUYikcwfQet_TCjVnIXCMWFiZrUQzilhfYkgqVEuSXQmtIv9u3fJIdSLSeGOgFgmlPeYZDLjrG20kjhxKuFti8WdUMdwuTZmOl0RMdKVujlOK1OklSlONlh7CvVyNndnPsWX-rzy6RdeD6K1 |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Proceedings+of+the+2016+ACM+Conference+on+Innovations+in+Theoretical+Computer+Science&rft.atitle=On+Hardness+of+Approximating+the+Parameterized+Clique+Problem&rft_id=info:doi/10.1145%2F2840728.2840733&rft.externalDocID=10.1145%2F2840728.2840733 |