From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More
We consider questions that arise from the intersection between the areas of approximation algorithms, subexponential-time algorithms, and fixed-parameter tractable algorithms. The questions, which have been asked several times (e.g., [1], [2], [3]) are whether there is a non-trivial FPT-approximatio...
Saved in:
Published in | 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS) pp. 743 - 754 |
---|---|
Main Authors | , , , , , , |
Format | Conference Proceeding |
Language | English |
Published |
IEEE
01.10.2017
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Abstract | We consider questions that arise from the intersection between the areas of approximation algorithms, subexponential-time algorithms, and fixed-parameter tractable algorithms. The questions, which have been asked several times (e.g., [1], [2], [3]) are whether there is a non-trivial FPT-approximation algorithm for the Maximum Clique (Clique) and Minimum Dominating Set (DomSet) problems parameterized by the size of the optimal solution. In particular, letting OPT be the optimum and N be the size of the input, is there an algorithm that runs in t(OPT) poly(N) time and outputs a solution of size f(OPT), for any functions t and f that are independent of N (for Clique, we want f(OPT) = ω(1))? In this paper, we show that both Clique and DomSet admit no non-trivial FPT-approximation algorithm, i.e., there is no o(OPT)-FPT-approximation algorithm for Clique and no f(OPT)-FPT-approximation algorithm for DomSet, for any function f (e.g., this holds even if f is an exponential or the Ackermann function). In fact, our results imply something even stronger: The best way to solve Clique and DomSet, even approximately, is to essentially enumerate all possibilities. Our results hold under the Gap Exponential Time Hypothesis (GapETH) [4], [5], which states that no 2 o(n) -time algorithm can distinguish between a satisfiable 3SAT formula and one which is not even (1 - ε)-satisfiable for some constant ε > 0. Besides Clique and DomSet, we also rule out non-trivial FPT-approximation for Maximum Balanced Biclique, the problem of finding maximum subgraphs with hereditary properties (e.g., Maximum Induced Planar Subgraph), and Maximum Induced Matching in bipartite graphs. Previously only exact versions of these problems were known to be W[1]-hard [6], [7], [8]. Additionally, we rule out k o(1) -FPT-approximation algorithm for Densest k-Subgraph although this ratio does not yet match the trivial O(k)-approximation algorithm. To the best of our knowledge, prior results only rule out constant factor approximation for Clique [9], [10] and log 1/4+ε (OPT) approximation for DomSet for any constant ε > 0 [11]. Our result on Clique significantly improves on [9], [10]. However, our result on DomSet is incomparable to [11] since their results hold under ETH while our results hold under Gap-ETH, which is a stronger assumption. |
---|---|
AbstractList | We consider questions that arise from the intersection between the areas of approximation algorithms, subexponential-time algorithms, and fixed-parameter tractable algorithms. The questions, which have been asked several times (e.g., [1], [2], [3]) are whether there is a non-trivial FPT-approximation algorithm for the Maximum Clique (Clique) and Minimum Dominating Set (DomSet) problems parameterized by the size of the optimal solution. In particular, letting OPT be the optimum and N be the size of the input, is there an algorithm that runs in t(OPT) poly(N) time and outputs a solution of size f(OPT), for any functions t and f that are independent of N (for Clique, we want f(OPT) = ω(1))? In this paper, we show that both Clique and DomSet admit no non-trivial FPT-approximation algorithm, i.e., there is no o(OPT)-FPT-approximation algorithm for Clique and no f(OPT)-FPT-approximation algorithm for DomSet, for any function f (e.g., this holds even if f is an exponential or the Ackermann function). In fact, our results imply something even stronger: The best way to solve Clique and DomSet, even approximately, is to essentially enumerate all possibilities. Our results hold under the Gap Exponential Time Hypothesis (GapETH) [4], [5], which states that no 2 o(n) -time algorithm can distinguish between a satisfiable 3SAT formula and one which is not even (1 - ε)-satisfiable for some constant ε > 0. Besides Clique and DomSet, we also rule out non-trivial FPT-approximation for Maximum Balanced Biclique, the problem of finding maximum subgraphs with hereditary properties (e.g., Maximum Induced Planar Subgraph), and Maximum Induced Matching in bipartite graphs. Previously only exact versions of these problems were known to be W[1]-hard [6], [7], [8]. Additionally, we rule out k o(1) -FPT-approximation algorithm for Densest k-Subgraph although this ratio does not yet match the trivial O(k)-approximation algorithm. To the best of our knowledge, prior results only rule out constant factor approximation for Clique [9], [10] and log 1/4+ε (OPT) approximation for DomSet for any constant ε > 0 [11]. Our result on Clique significantly improves on [9], [10]. However, our result on DomSet is incomparable to [11] since their results hold under ETH while our results hold under Gap-ETH, which is a stronger assumption. |
Author | Kortsarz, Guy Nanongkai, Danupon Cygan, Marek Chalermsook, Parinya Trevisan, Luca Laekhanukit, Bundit Manurangsi, Pasin |
Author_xml | – sequence: 1 givenname: Parinya surname: Chalermsook fullname: Chalermsook, Parinya email: parinya.chalermsook@aalto.fi organization: CS, Aalto Univ., Espoo, Finland – sequence: 2 givenname: Marek surname: Cygan fullname: Cygan, Marek email: cygan@mimuw.edu.pl organization: Inf. Inst., Univ. of Warsaw, Warsaw, Poland – sequence: 3 givenname: Guy surname: Kortsarz fullname: Kortsarz, Guy email: guyk@camden.rutgers.edu organization: CS, Rutgers Univ.-Camden, Camden, NJ, USA – sequence: 4 givenname: Bundit surname: Laekhanukit fullname: Laekhanukit, Bundit email: bundit.laekhanukit@mail.mcgill.ca organization: Math & CS, Weizmann Inst. of Sci., Rehovot, Israel – sequence: 5 givenname: Pasin surname: Manurangsi fullname: Manurangsi, Pasin email: pasin@berkeley.edu organization: EECS, UC Berkeley, Berkeley, CA, USA – sequence: 6 givenname: Danupon surname: Nanongkai fullname: Nanongkai, Danupon email: danupon@kth.se organization: CSC, KTH R. Inst. of Technol., Stockholm, Sweden – sequence: 7 givenname: Luca surname: Trevisan fullname: Trevisan, Luca email: luca@berkeley.edu organization: EECS, UC Berkeley, Berkeley, CA, USA |
BookMark | eNotjk9LwzAchiNMcJ3evHnJB1hq0vxp6k3q2g0mE1bP42eaSqRNalth-_YW9PReHp7njdDCB28Rumc0Zoxmj8UhP8YJZWmciisUMcm14kIJvkBLmqQJkSLRNygaxy9KBZWUL1FZDKHDJfRkU23xFHDxVpGdh74fwtl18OFaN12ecN667x-7xi-hcx4m5z_x0U5rDL7Gr2Gwt-i6gXa0d_-7Qu_Fpsq3ZH8od_nznrgkzSbC5ixIqyykRkOtlAQtoNG1TqlQoI1kGTVNZjIQUlpmmK15YyTUM2W44Cv08Od11tpTP8wXh8tJMyoYVfwXMuxK-w |
CODEN | IEEPAD |
ContentType | Conference Proceeding |
DBID | 6IE 6IH CBEJK RIE RIO |
DOI | 10.1109/FOCS.2017.74 |
DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Proceedings Order Plan (POP) 1998-present by volume IEEE Xplore All Conference Proceedings IEEE Electronic Library (IEL) IEEE Proceedings Order Plans (POP) 1998-present |
DatabaseTitleList | |
Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/ sourceTypes: Publisher |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Mathematics Computer Science |
EISBN | 1538634643 9781538634646 |
EndPage | 754 |
ExternalDocumentID | 8104106 |
Genre | orig-research |
GroupedDBID | -~X 23M 6IE 6IF 6IH 6IK 6IL 6IM 6IN AAJGR ACNCT ADZIZ AFFNX AI. ALMA_UNASSIGNED_HOLDINGS BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK CHZPO IPLJI JC5 OCL RIE RIG RIL RIO RNS VH1 |
ID | FETCH-LOGICAL-i279t-1405a5e6ea7c8ad665a84af8d87046a8c5190cf9c9a455e1c1ed3fc5ad4afc343 |
IEDL.DBID | RIE |
ISSN | 0272-5428 |
IngestDate | Wed Jun 26 19:27:39 EDT 2024 |
IsPeerReviewed | false |
IsScholarly | false |
Language | English |
LinkModel | DirectLink |
MergedId | FETCHMERGED-LOGICAL-i279t-1405a5e6ea7c8ad665a84af8d87046a8c5190cf9c9a455e1c1ed3fc5ad4afc343 |
PageCount | 12 |
ParticipantIDs | ieee_primary_8104106 |
PublicationCentury | 2000 |
PublicationDate | 2017-10 |
PublicationDateYYYYMMDD | 2017-10-01 |
PublicationDate_xml | – month: 10 year: 2017 text: 2017-10 |
PublicationDecade | 2010 |
PublicationTitle | 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS) |
PublicationTitleAbbrev | SFCS |
PublicationYear | 2017 |
Publisher | IEEE |
Publisher_xml | – name: IEEE |
SSID | ssj0040503 |
Score | 2.0452454 |
Snippet | We consider questions that arise from the intersection between the areas of approximation algorithms, subexponential-time algorithms, and fixed-parameter... |
SourceID | ieee |
SourceType | Publisher |
StartPage | 743 |
SubjectTerms | Approximation algorithms Bipartite graph Clique Computer science Dominating Set Electronic mail Fixed Parameter Tractability Hardness of Approximation Minimization Optimized production technology Set Cover |
Title | From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More |
URI | https://ieeexplore.ieee.org/document/8104106 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjZ3PT8IwFMcb5KQXFDD-Tg8e2WBbu3VekYEmUxIg4Ubeui4hykZwJOpfb98G0xgP3pZl6Zo27evr-77PI-TW06cGYceRARh1Z9wDIwLtpdiRIzxfYaQG853DJ3c0Y49zPq-RTpULo5QqxGfKxMcilh9ncotXZV2hfQcL-doHomeXuVr7XZch16S4T_GQ7W-LSuTud4Pn_gRFXJ6Jsr4fRVQKGxI0SLj_eykdeTG3eWTKz19gxv9275i0v7P16LiyQyekptImaezLNdDd6m2So7BCtL61yDDYZCs6hLUxmI5ontFgPDUe0oIx_r5clfjujzvaf0XCa4feZyiaQZE0nai8QyGNaah72CazYDDtj4xdVQVjaXt-bmiPigNXrgJPCohdl4NgkIhYr1zmgpD6TNeTiS99YJwrS1oqdhLJIdZfSYc5p6SeZqk6I5QxqXdHbd38xGGulQDTTTqgvRxh-wnAOWnhKC3WJThjsRugi79fX5JDnKRSKXdF6vlmq661xc-jm2KqvwCeL6i5 |
link.rule.ids | 310,311,786,790,795,796,802,23958,23959,25170,27958,55109 |
linkProvider | IEEE |
linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3PT8IwFG6IHtQLChh_24NHNtjWbp1XZIAyJGEk3Mhb1yVE2QiORP3rbTeYxnjw1jRN27Rpv76-730PoTtHvhqYGYUaKK87oQ5oIUgrxQwt5rhCeWpUvLM_svtT8jijswpqlrEwQoicfCZ0Vcx9-VHKN-qrrMWk7WAofe19ifNtt4jW2t27RCmb5D8qjlL3N1lJc3db3nNnomhcjq6IfT_SqOQo4lWRvxu_II-86Jss1PnnL2nG_07wGDW-4_XwuESiE1QRSQ1Vdwkb8Pb81tCRX4q0vtVRz1unS9yDldYN-jhLsTcOtEGSq4y_L5aFgPfHPe68Ko3XJn5IFW1G0aTxRGRNDEmEfTnDBpp63aDT17Z5FbSF6biZJm0qClTYAhzOILJtCoxAzCJ5dokNjMtXXZvHLneBUCoMbojIijmFSLbiFrFO0V6SJuIMYUK4vB8lvrmxRWwjBiK7tEDaOcx0Y4BzVFerNF8V0hnz7QJd_F19iw76gT-cDwejp0t0qDas4M1dob1svRHXEv-z8Cbf9i-3rawP |
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%3Ajournal&rft.genre=proceeding&rft.title=2017+IEEE+58th+Annual+Symposium+on+Foundations+of+Computer+Science+%28FOCS%29&rft.atitle=From+Gap-ETH+to+FPT-Inapproximability%3A+Clique%2C+Dominating+Set%2C+and+More&rft.au=Chalermsook%2C+Parinya&rft.au=Cygan%2C+Marek&rft.au=Kortsarz%2C+Guy&rft.au=Laekhanukit%2C+Bundit&rft.date=2017-10-01&rft.pub=IEEE&rft.issn=0272-5428&rft.spage=743&rft.epage=754&rft_id=info:doi/10.1109%2FFOCS.2017.74&rft.externalDocID=8104106 |
thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0272-5428&client=summon |
thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0272-5428&client=summon |
thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0272-5428&client=summon |