Towards a characterization of constant-factor approximable finite-valued CSPs
We study the approximability of (Finite-)Valued Constraint Satisfaction Problems (VCSPs) with a fixed finite constraint language Γ consisting of finitary functions on a fixed finite domain. Ene et al. have shown that, under a mild technical condition, the basic LP relaxation is optimal for constant-...
Saved in:
| Published in | Journal of computer and system sciences Vol. 97; pp. 14 - 27 |
|---|---|
| Main Authors | , , |
| Format | Journal Article |
| Language | English |
| Published |
Elsevier Inc
01.11.2018
|
| Subjects | |
| Online Access | Get full text |
Cover
Loading…
| Abstract | We study the approximability of (Finite-)Valued Constraint Satisfaction Problems (VCSPs) with a fixed finite constraint language Γ consisting of finitary functions on a fixed finite domain. Ene et al. have shown that, under a mild technical condition, the basic LP relaxation is optimal for constant-factor approximation for VCSP(Γ) unless the Unique Games Conjecture fails. Using the algebraic approach to the CSP, we give new natural algebraic conditions for the finiteness of the integrality gap for the basic LP relaxation of VCSP(Γ) and show how this leads to efficient constant-factor approximation algorithms for several examples that cover all previously known cases that are NP-hard to solve to optimality but admit constant-factor approximation. Finally, we show that the absence of another algebraic condition leads to NP-hardness of constant-factor approximation. Thus, our results indicate where the boundary of constant-factor approximability for VCSPs lies.
•New natural algebraic conditions for the finiteness of the integrality gap for the basic LP relaxation of VCSP are given.•Efficient constant-factor approximation algorithms using the algebraic conditions are given.•Algebraic conditions for NP-hardness of constant-factor approximation are given. |
|---|---|
| AbstractList | We study the approximability of (Finite-)Valued Constraint Satisfaction Problems (VCSPs) with a fixed finite constraint language Γ consisting of finitary functions on a fixed finite domain. Ene et al. have shown that, under a mild technical condition, the basic LP relaxation is optimal for constant-factor approximation for VCSP(Γ) unless the Unique Games Conjecture fails. Using the algebraic approach to the CSP, we give new natural algebraic conditions for the finiteness of the integrality gap for the basic LP relaxation of VCSP(Γ) and show how this leads to efficient constant-factor approximation algorithms for several examples that cover all previously known cases that are NP-hard to solve to optimality but admit constant-factor approximation. Finally, we show that the absence of another algebraic condition leads to NP-hardness of constant-factor approximation. Thus, our results indicate where the boundary of constant-factor approximability for VCSPs lies.
•New natural algebraic conditions for the finiteness of the integrality gap for the basic LP relaxation of VCSP are given.•Efficient constant-factor approximation algorithms using the algebraic conditions are given.•Algebraic conditions for NP-hardness of constant-factor approximation are given. |
| Author | Dalmau, Víctor Manokaran, Rajsekar Krokhin, Andrei |
| Author_xml | – sequence: 1 givenname: Víctor surname: Dalmau fullname: Dalmau, Víctor email: victor.dalmau@upf.edu organization: Department of Information and Communication Technologies, Universitat Pompeu Fabra, Spain – sequence: 2 givenname: Andrei surname: Krokhin fullname: Krokhin, Andrei email: Andrei.Krokhin@durham.ac.uk organization: Department of Computer Science, Durham University, UK – sequence: 3 givenname: Rajsekar surname: Manokaran fullname: Manokaran, Rajsekar email: rajsekar@gmail.com organization: Computer Science and Engineering Department, IIT Madras, India |
| BookMark | eNp9kNtKAzEQhoNUsK2-gFd5gV0nh-5uwBspnqCi4N6HHDFL3ZQk1sPTu6VeOzcz8PMNP98CzcY4OoQuCdQESHM11IPJuaZAuhpYDcBO0JyAgIq2lM_QHIDSCqY5Q4ucBwBCVg2bo6c-fqpkM1bYvKmkTHEp_KgS4oijxyaOuaixVH5KYsJqt0vxK7wrvXXYhzEUV-3V9sNZvH59yefo1Kttdhd_e4n6u9t-_VBtnu8f1zebyjDOS2U7IVbMeqIsb3WriWEdCG4ZF9Zq7wVlrG2EMCCM0Masplt3wL2iWtOGLRE9vjUp5pycl7s0dUrfkoA8-JCDPPiQBx8SmJx8TND1EXJTsX1wSWYT3GicDcmZIm0M_-G_KQtsTA |
| CitedBy_id | crossref_primary_10_1145_3624704 crossref_primary_10_1145_3457606 |
| Cites_doi | 10.1016/j.artint.2006.04.002 10.1093/logcom/exq030 10.1137/S0097539704443057 10.1145/2556646 10.1137/130906398 10.1145/2535926 10.1145/2540090 10.1137/S0097539794266766 10.1007/s00037-008-0256-y 10.1007/BF01187059 10.1145/1391289.1391290 10.1145/502090.502098 10.1145/3134757 10.1145/2974019 10.1007/s00224-015-9638-0 10.1137/16M1091836 10.1142/S0218196716500429 10.1145/1236457.1236459 10.1137/S0097539705447372 10.1137/S0097539700376676 10.1137/130915479 10.1137/130945648 10.1007/s00012-015-0327-2 10.1016/j.ejc.2015.07.011 10.4086/toc.2012.v008a011 |
| ContentType | Journal Article |
| Copyright | 2018 Elsevier Inc. |
| Copyright_xml | – notice: 2018 Elsevier Inc. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.jcss.2018.03.003 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science |
| EISSN | 1090-2724 |
| EndPage | 27 |
| ExternalDocumentID | 10_1016_j_jcss_2018_03_003 S0022000018302307 |
| GrantInformation_xml | – fundername: Maria de Maeztu Units of Excellence Programme grantid: MDM-2015-0502 – fundername: EPSRC grantid: EP/J000078/01 funderid: https://doi.org/10.13039/501100000266 – fundername: ERC grantid: 226-203 funderid: https://doi.org/10.13039/100010663 – fundername: MICCIN grantid: TIN2016-76573-C2-1P |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1OL 1~. 1~5 29K 4.4 457 4G. 5GY 5VS 6I. 6TJ 7-5 71M 8P~ 9JN AACTN AAEDT AAEDW AAFTH AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN AAYJJ ABBOA ABEFU ABJNI ABMAC ABTAH ABVKL ABXDB ABYKQ ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADFGL ADMUD AEBSH AEKER AENEX AETEA AEXQZ AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ASPBG AVWKF AXJTR AZFZN BKOJK BLXMC CAG COF CS3 D-I DM4 DU5 EBS EFBJH EFLBG EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q G8K GBLVA GBOLZ HVGLF HZ~ IHE IXB J1W KOM LG5 LG9 LY7 M41 MO0 MVM N9A NCXOZ O-L O9- OAUVE OHT OK1 OZT P-8 P-9 P2P PC. Q38 R2- RIG RNS ROL RPZ SDF SDG SDP SES SEW SPC SPCBC SSV SSZ T5K TN5 TWZ UPT WH7 WUQ XJT XOL XPP YQT ZCG ZMT ZU3 ZY4 ~G- 0SF AAXKI AAYXX ADVLN AFJKZ AKRWK CITATION |
| ID | FETCH-LOGICAL-c344t-d89953df1ad47b7b1c38094d349ddbff92337699c09c9bcc5699b804fa2bb263 |
| IEDL.DBID | ABVKL |
| ISSN | 0022-0000 |
| IngestDate | Thu Sep 26 19:22:21 EDT 2024 Fri Feb 23 02:19:39 EST 2024 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Constraint satisfaction problem Universal algebra Approximation algorithms |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c344t-d89953df1ad47b7b1c38094d349ddbff92337699c09c9bcc5699b804fa2bb263 |
| OpenAccessLink | https://doi.org/10.1016/j.jcss.2018.03.003 |
| PageCount | 14 |
| ParticipantIDs | crossref_primary_10_1016_j_jcss_2018_03_003 elsevier_sciencedirect_doi_10_1016_j_jcss_2018_03_003 |
| PublicationCentury | 2000 |
| PublicationDate | November 2018 2018-11-00 |
| PublicationDateYYYYMMDD | 2018-11-01 |
| PublicationDate_xml | – month: 11 year: 2018 text: November 2018 |
| PublicationDecade | 2010 |
| PublicationTitle | Journal of computer and system sciences |
| PublicationYear | 2018 |
| Publisher | Elsevier Inc |
| Publisher_xml | – name: Elsevier Inc |
| References | Bulatov, Jeavons, Krokhin (br0060) 2005; 34 Cohen, Cooper, Jeavons, Krokhin (br0190) 2006; 170 Creignou, Khanna, Sudan (br0010) 2001; vol. 7 (br0030) 2017; vol. 7 Dinur (br0240) 2007; 54 Schaefer (br0080) 1978 Baker, Pixley (br0470) 1975; 143 Makarychev, Makarychev (br0220) 2017; vol. 7 Barto, Kozik, Willard (br0430) 2012 Chen, Larose (br0510) 2017; 9 Manokaran, Naor, Raghavendra, Schwartz (br0350) 2008 Dalmau, Kozik, Krokhin, Makarychev, Makarychev, Opršal (br0380) 2017 Barto, Kozik (br0100) 2016; 45 Carvalho, Krokhin (br0500) 2016; 26 Guruswami, Lee (br0300) 2016; 59 Håstad (br0270) 2008; 17 Kumar, Manokaran, Tulsiani, Vishnoi (br0340) 2011 Khot, Tulsiani, Worah (br0280) 2014 Schrijver (br0450) 1986 Gärtner, Matoušek (br0370) 2012 Feder, Vardi (br0070) 1998; 28 Gottlob, Greco, Scarcello (br0040) 2009 Zhuk (br0150) 2017 Guruswami, Zhou (br0310) 2012; 8 Ene, Vondrák, Wu (br0200) 2013 Dinur, Guruswami, Khot, Regev (br0480) 2005; 34 Khot, Kindler, Mossel, O'Donnell (br0320) 2007; 37 Krokhin, Živný (br0410) 2017; vol. 7 Kolmogorov, Thapper, Živný (br0420) 2015; 44 Kun, Szegedy (br0440) 2016; 52 Kolmogorov, Krokhin, Rolínek (br0130) 2017; 46 Kun, O'Donnell, Suguru, Yoshida, Zhou (br0390) 2012 Arora, Barak (br0230) 2009 Bulatov (br0110) 2017 Håstad (br0250) 2001; 48 Raghavendra (br0170) 2008 Barto, Kozik (br0090) 2014; 61 Dalmau, Krokhin (br0330) 2013; 5 Marx (br0050) 2013; 60 Brown-Cohen, Raghavendra (br0160) 2015 Khot (br0210) 2010 Barto, Krokhin, Willard (br0400) 2017 Deineko, Jonsson, Klasson, Krokhin (br0120) 2008; 55 Austrin (br0260) 2008 Thapper, Živný (br0140) 2016; 63 (br0020) 2008; vol. 5250 Cohen, Cooper, Creed, Jeavons, Živný (br0180) 2013; 42 Kozik, Krokhin, Valeriote, Willard (br0490) 2015; 73 Agarwal, Charikar, Makarychev, Makarychev (br0290) 2005 Raghavendra, Steurer (br0360) 2009 Carvalho, Dalmau, Krokhin (br0460) 2011; 21 Bulatov (10.1016/j.jcss.2018.03.003_br0110) 2017 (10.1016/j.jcss.2018.03.003_br0020) 2008; vol. 5250 (10.1016/j.jcss.2018.03.003_br0030) 2017; vol. 7 Chen (10.1016/j.jcss.2018.03.003_br0510) 2017; 9 Krokhin (10.1016/j.jcss.2018.03.003_br0410) 2017; vol. 7 Carvalho (10.1016/j.jcss.2018.03.003_br0460) 2011; 21 Guruswami (10.1016/j.jcss.2018.03.003_br0310) 2012; 8 Kun (10.1016/j.jcss.2018.03.003_br0390) 2012 Dalmau (10.1016/j.jcss.2018.03.003_br0330) 2013; 5 Kun (10.1016/j.jcss.2018.03.003_br0440) 2016; 52 Cohen (10.1016/j.jcss.2018.03.003_br0180) 2013; 42 Khot (10.1016/j.jcss.2018.03.003_br0320) 2007; 37 Håstad (10.1016/j.jcss.2018.03.003_br0270) 2008; 17 Creignou (10.1016/j.jcss.2018.03.003_br0010) 2001; vol. 7 Kolmogorov (10.1016/j.jcss.2018.03.003_br0130) 2017; 46 Deineko (10.1016/j.jcss.2018.03.003_br0120) 2008; 55 Barto (10.1016/j.jcss.2018.03.003_br0100) 2016; 45 Ene (10.1016/j.jcss.2018.03.003_br0200) 2013 Gottlob (10.1016/j.jcss.2018.03.003_br0040) 2009 Barto (10.1016/j.jcss.2018.03.003_br0400) 2017 Dinur (10.1016/j.jcss.2018.03.003_br0480) 2005; 34 Cohen (10.1016/j.jcss.2018.03.003_br0190) 2006; 170 Brown-Cohen (10.1016/j.jcss.2018.03.003_br0160) 2015 Raghavendra (10.1016/j.jcss.2018.03.003_br0170) 2008 Feder (10.1016/j.jcss.2018.03.003_br0070) 1998; 28 Baker (10.1016/j.jcss.2018.03.003_br0470) 1975; 143 Carvalho (10.1016/j.jcss.2018.03.003_br0500) 2016; 26 Marx (10.1016/j.jcss.2018.03.003_br0050) 2013; 60 Dinur (10.1016/j.jcss.2018.03.003_br0240) 2007; 54 Schaefer (10.1016/j.jcss.2018.03.003_br0080) 1978 Arora (10.1016/j.jcss.2018.03.003_br0230) 2009 Kozik (10.1016/j.jcss.2018.03.003_br0490) 2015; 73 Schrijver (10.1016/j.jcss.2018.03.003_br0450) 1986 Makarychev (10.1016/j.jcss.2018.03.003_br0220) 2017; vol. 7 Khot (10.1016/j.jcss.2018.03.003_br0280) 2014 Dalmau (10.1016/j.jcss.2018.03.003_br0380) 2017 Khot (10.1016/j.jcss.2018.03.003_br0210) 2010 Raghavendra (10.1016/j.jcss.2018.03.003_br0360) 2009 Kumar (10.1016/j.jcss.2018.03.003_br0340) 2011 Manokaran (10.1016/j.jcss.2018.03.003_br0350) 2008 Barto (10.1016/j.jcss.2018.03.003_br0430) 2012 Thapper (10.1016/j.jcss.2018.03.003_br0140) 2016; 63 Bulatov (10.1016/j.jcss.2018.03.003_br0060) 2005; 34 Zhuk (10.1016/j.jcss.2018.03.003_br0150) 2017 Barto (10.1016/j.jcss.2018.03.003_br0090) 2014; 61 Håstad (10.1016/j.jcss.2018.03.003_br0250) 2001; 48 Austrin (10.1016/j.jcss.2018.03.003_br0260) 2008 Agarwal (10.1016/j.jcss.2018.03.003_br0290) 2005 Guruswami (10.1016/j.jcss.2018.03.003_br0300) 2016; 59 Gärtner (10.1016/j.jcss.2018.03.003_br0370) 2012 Kolmogorov (10.1016/j.jcss.2018.03.003_br0420) 2015; 44 |
| References_xml | – volume: vol. 7 year: 2017 ident: br0030 publication-title: The Constraint Satisfaction Problem: Complexity and Approximability – volume: 73 start-page: 205 year: 2015 end-page: 224 ident: br0490 article-title: Characterizations of several Maltsev conditions publication-title: Algebra Univers. contributor: fullname: Willard – volume: 55 year: 2008 ident: br0120 article-title: The approximability of Max CSP with fixed-value constraints publication-title: J. ACM contributor: fullname: Krokhin – volume: 45 start-page: 1646 year: 2016 end-page: 1669 ident: br0100 article-title: Robust satisfiability of constraint satisfaction problems publication-title: SIAM J. Comput. contributor: fullname: Kozik – start-page: 306 year: 2013 end-page: 325 ident: br0200 article-title: Local distribution and the symmetry gap: approximability of multiway partitioning problems publication-title: SODA contributor: fullname: Wu – volume: 17 start-page: 549 year: 2008 end-page: 566 ident: br0270 article-title: Every 2-CSP allows nontrivial approximation publication-title: Comput. Complex. contributor: fullname: Håstad – start-page: 216 year: 1978 end-page: 226 ident: br0080 article-title: The complexity of satisfiability problems publication-title: STOC'78 contributor: fullname: Schaefer – volume: 8 year: 2012 ident: br0310 article-title: Tight bounds on the approximability of Almost-satisfiable Horn SAT and Exact Hitting Set publication-title: Theory Comput. contributor: fullname: Zhou – volume: vol. 5250 year: 2008 ident: br0020 publication-title: Complexity of Constraints – volume: 37 start-page: 319 year: 2007 end-page: 357 ident: br0320 article-title: Optimal inapproximability results for Max-Cut and other 2-variable CSPs? publication-title: SIAM J. Sci. Comput. contributor: fullname: O'Donnell – volume: 9 year: 2017 ident: br0510 article-title: Asking the metaquestions in constraint tractability publication-title: ACM Trans. Comput. Theory contributor: fullname: Larose – volume: 21 start-page: 1065 year: 2011 end-page: 1092 ident: br0460 article-title: Two new homomorphism dualities and lattice operations publication-title: J. Log. Comput. contributor: fullname: Krokhin – volume: 170 start-page: 983 year: 2006 end-page: 1016 ident: br0190 article-title: The complexity of soft constraint satisfaction publication-title: Artif. Intell. contributor: fullname: Krokhin – volume: 5 year: 2013 ident: br0330 article-title: Robust satisfiability for CSPs: hardness and algorithmic results publication-title: ACM Trans. Comput. Theory contributor: fullname: Krokhin – start-page: 99 year: 2010 end-page: 121 ident: br0210 article-title: On the unique games conjecture publication-title: CCC'10 contributor: fullname: Khot – volume: 48 start-page: 798 year: 2001 end-page: 859 ident: br0250 article-title: Some optimal inapproximability results publication-title: J. ACM contributor: fullname: Håstad – volume: 59 start-page: 76 year: 2016 end-page: 98 ident: br0300 article-title: Complexity of approximating CSP with balance/hard constraints publication-title: Theory Comput. Syst. contributor: fullname: Lee – volume: 28 start-page: 57 year: 1998 end-page: 104 ident: br0070 article-title: The computational structure of monotone monadic SNP and constraint satisfaction: a study through Datalog and group theory publication-title: SIAM J. Sci. Comput. contributor: fullname: Vardi – start-page: 484 year: 2012 end-page: 495 ident: br0390 article-title: Linear programming, width-1 CSPs, and robust satisfaction publication-title: ITCS'12 contributor: fullname: Zhou – volume: 46 start-page: 1087 year: 2017 end-page: 1110 ident: br0130 article-title: The complexity of general-valued CSPs publication-title: SIAM J. Comput. contributor: fullname: Rolínek – year: 2008 ident: br0260 article-title: Conditional Inapproximability and Limited Independence contributor: fullname: Austrin – volume: 26 start-page: 1019 year: 2016 end-page: 1032 ident: br0500 article-title: On algebras with many symmetric operations publication-title: Int. J. Algebra Comput. contributor: fullname: Krokhin – year: 2009 ident: br0230 article-title: Computational Complexity: A Modern Approach contributor: fullname: Barak – start-page: 573 year: 2005 end-page: 581 ident: br0290 article-title: approximation algorithms for MinUnCut, Min 2CNF Deletion, and Directed Cut problems publication-title: STOC'05 contributor: fullname: Makarychev – volume: vol. 7 start-page: 287 year: 2017 end-page: 325 ident: br0220 article-title: Approximation algorithms for CSPs publication-title: The Constraint Satisfaction Problem: Complexity and Approximability contributor: fullname: Makarychev – start-page: 586 year: 2009 end-page: 594 ident: br0360 article-title: How to round any CSP publication-title: FOCS'09 contributor: fullname: Steurer – year: 1986 ident: br0450 article-title: Theory of Linear and Integer Programming contributor: fullname: Schrijver – start-page: 1 year: 2017 end-page: 44 ident: br0400 article-title: Polymorphisms, and how to use them publication-title: The Constraint Satisfaction Problem: Complexity and Approximability contributor: fullname: Willard – start-page: 16 year: 2009 end-page: 30 ident: br0040 article-title: Tractable optimization problems through hypergraph-based structural restrictions publication-title: Proceedings of ICALP'09 contributor: fullname: Scarcello – volume: 61 year: 2014 ident: br0090 article-title: Constraint satisfaction problems solvable by local consistency methods publication-title: J. ACM contributor: fullname: Kozik – volume: 54 year: 2007 ident: br0240 article-title: The PCP theorem by gap amplification publication-title: J. ACM contributor: fullname: Dinur – volume: vol. 7 start-page: 233 year: 2017 end-page: 266 ident: br0410 article-title: The complexity of valued CSPs publication-title: The Constraint Satisfaction Problem: Complexity and Approximability contributor: fullname: Živný – start-page: 634 year: 2014 end-page: 643 ident: br0280 article-title: A characterization of strong approximation resistance publication-title: Symposium on Theory of Computing contributor: fullname: Worah – volume: 63 year: 2016 ident: br0140 article-title: The complexity of finite-valued CSPs publication-title: J. ACM contributor: fullname: Živný – volume: vol. 7 year: 2001 ident: br0010 article-title: Complexity Classifications of Boolean Constraint Satisfaction Problems publication-title: SIAM Monographs on Discrete Mathematics and Applications contributor: fullname: Sudan – volume: 34 start-page: 1129 year: 2005 end-page: 1146 ident: br0480 article-title: A new multilayered PCP and the hardness of hypergraph vertex cover publication-title: SIAM J. Comput. contributor: fullname: Regev – start-page: 125 year: 2012 end-page: 134 ident: br0430 article-title: Near unanimity constraints have bounded pathwidth duality publication-title: LICS contributor: fullname: Willard – start-page: 11 year: 2008 end-page: 20 ident: br0350 article-title: SDP gaps and UGC hardness for multiway cut, 0-extension, and metric labeling publication-title: STOC contributor: fullname: Schwartz – start-page: 319 year: 2017 end-page: 330 ident: br0110 article-title: A dichotomy theorem for nonuniform CSPs publication-title: FOCS'17 contributor: fullname: Bulatov – start-page: 1560 year: 2011 end-page: 1573 ident: br0340 article-title: On LP-based approximability for strict CSPs publication-title: SODA contributor: fullname: Vishnoi – start-page: 331 year: 2017 end-page: 342 ident: br0150 article-title: The proof of CSP dichotomy conjecture publication-title: FOCS'17 contributor: fullname: Zhuk – start-page: 245 year: 2008 end-page: 254 ident: br0170 article-title: Optimal algorithms and inapproximability results for every CSP? publication-title: STOC'08 contributor: fullname: Raghavendra – year: 2015 ident: br0160 article-title: Combinatorial Optimization Algorithms Via Polymorphisms contributor: fullname: Raghavendra – volume: 42 start-page: 1915 year: 2013 end-page: 1939 ident: br0180 article-title: An algebraic theory of complexity for discrete optimisation publication-title: SIAM J. Comput. contributor: fullname: Živný – volume: 143 start-page: 165 year: 1975 end-page: 174 ident: br0470 article-title: Polynomial interpolation and the Chinese remainder theorem publication-title: Math. Z. contributor: fullname: Pixley – volume: 60 year: 2013 ident: br0050 article-title: Tractable hypergraph properties for constraint satisfaction and conjunctive queries publication-title: J. ACM contributor: fullname: Marx – year: 2012 ident: br0370 article-title: Approximation Algorithms and Semidefinite Programming contributor: fullname: Matoušek – start-page: 340 year: 2017 end-page: 357 ident: br0380 article-title: Robust algorithms with polynomial loss for near-unanimity CSPs publication-title: SODA'17 contributor: fullname: Opršal – volume: 34 start-page: 720 year: 2005 end-page: 742 ident: br0060 article-title: Classifying complexity of constraints using finite algebras publication-title: SIAM J. Comput. contributor: fullname: Krokhin – volume: 44 start-page: 1 year: 2015 end-page: 36 ident: br0420 article-title: The power of linear programming for general-valued CSPs publication-title: SIAM J. Comput. contributor: fullname: Živný – volume: 52 start-page: 338 year: 2016 end-page: 367 ident: br0440 article-title: A new line of attack on the dichotomy conjecture publication-title: Eur. J. Comb. contributor: fullname: Szegedy – volume: 170 start-page: 983 issue: 11 year: 2006 ident: 10.1016/j.jcss.2018.03.003_br0190 article-title: The complexity of soft constraint satisfaction publication-title: Artif. Intell. doi: 10.1016/j.artint.2006.04.002 contributor: fullname: Cohen – volume: 21 start-page: 1065 issue: 6 year: 2011 ident: 10.1016/j.jcss.2018.03.003_br0460 article-title: Two new homomorphism dualities and lattice operations publication-title: J. Log. Comput. doi: 10.1093/logcom/exq030 contributor: fullname: Carvalho – volume: 34 start-page: 1129 issue: 5 year: 2005 ident: 10.1016/j.jcss.2018.03.003_br0480 article-title: A new multilayered PCP and the hardness of hypergraph vertex cover publication-title: SIAM J. Comput. doi: 10.1137/S0097539704443057 contributor: fullname: Dinur – volume: 61 issue: 1 year: 2014 ident: 10.1016/j.jcss.2018.03.003_br0090 article-title: Constraint satisfaction problems solvable by local consistency methods publication-title: J. ACM doi: 10.1145/2556646 contributor: fullname: Barto – volume: vol. 7 start-page: 233 year: 2017 ident: 10.1016/j.jcss.2018.03.003_br0410 article-title: The complexity of valued CSPs contributor: fullname: Krokhin – start-page: 11 year: 2008 ident: 10.1016/j.jcss.2018.03.003_br0350 article-title: SDP gaps and UGC hardness for multiway cut, 0-extension, and metric labeling contributor: fullname: Manokaran – start-page: 573 year: 2005 ident: 10.1016/j.jcss.2018.03.003_br0290 article-title: O(logn) approximation algorithms for MinUnCut, Min 2CNF Deletion, and Directed Cut problems contributor: fullname: Agarwal – volume: 42 start-page: 1915 issue: 5 year: 2013 ident: 10.1016/j.jcss.2018.03.003_br0180 article-title: An algebraic theory of complexity for discrete optimisation publication-title: SIAM J. Comput. doi: 10.1137/130906398 contributor: fullname: Cohen – start-page: 216 year: 1978 ident: 10.1016/j.jcss.2018.03.003_br0080 article-title: The complexity of satisfiability problems contributor: fullname: Schaefer – volume: 60 issue: 6 year: 2013 ident: 10.1016/j.jcss.2018.03.003_br0050 article-title: Tractable hypergraph properties for constraint satisfaction and conjunctive queries publication-title: J. ACM doi: 10.1145/2535926 contributor: fullname: Marx – start-page: 245 year: 2008 ident: 10.1016/j.jcss.2018.03.003_br0170 article-title: Optimal algorithms and inapproximability results for every CSP? contributor: fullname: Raghavendra – volume: 5 issue: 4 year: 2013 ident: 10.1016/j.jcss.2018.03.003_br0330 article-title: Robust satisfiability for CSPs: hardness and algorithmic results publication-title: ACM Trans. Comput. Theory doi: 10.1145/2540090 contributor: fullname: Dalmau – start-page: 340 year: 2017 ident: 10.1016/j.jcss.2018.03.003_br0380 article-title: Robust algorithms with polynomial loss for near-unanimity CSPs contributor: fullname: Dalmau – start-page: 484 year: 2012 ident: 10.1016/j.jcss.2018.03.003_br0390 article-title: Linear programming, width-1 CSPs, and robust satisfaction contributor: fullname: Kun – year: 2008 ident: 10.1016/j.jcss.2018.03.003_br0260 contributor: fullname: Austrin – start-page: 1 year: 2017 ident: 10.1016/j.jcss.2018.03.003_br0400 article-title: Polymorphisms, and how to use them contributor: fullname: Barto – volume: 28 start-page: 57 year: 1998 ident: 10.1016/j.jcss.2018.03.003_br0070 article-title: The computational structure of monotone monadic SNP and constraint satisfaction: a study through Datalog and group theory publication-title: SIAM J. Sci. Comput. doi: 10.1137/S0097539794266766 contributor: fullname: Feder – year: 2009 ident: 10.1016/j.jcss.2018.03.003_br0230 contributor: fullname: Arora – start-page: 331 year: 2017 ident: 10.1016/j.jcss.2018.03.003_br0150 article-title: The proof of CSP dichotomy conjecture contributor: fullname: Zhuk – volume: 17 start-page: 549 issue: 4 year: 2008 ident: 10.1016/j.jcss.2018.03.003_br0270 article-title: Every 2-CSP allows nontrivial approximation publication-title: Comput. Complex. doi: 10.1007/s00037-008-0256-y contributor: fullname: Håstad – start-page: 319 year: 2017 ident: 10.1016/j.jcss.2018.03.003_br0110 article-title: A dichotomy theorem for nonuniform CSPs contributor: fullname: Bulatov – volume: vol. 5250 year: 2008 ident: 10.1016/j.jcss.2018.03.003_br0020 – volume: 143 start-page: 165 year: 1975 ident: 10.1016/j.jcss.2018.03.003_br0470 article-title: Polynomial interpolation and the Chinese remainder theorem publication-title: Math. Z. doi: 10.1007/BF01187059 contributor: fullname: Baker – start-page: 16 year: 2009 ident: 10.1016/j.jcss.2018.03.003_br0040 article-title: Tractable optimization problems through hypergraph-based structural restrictions contributor: fullname: Gottlob – volume: 55 issue: 4 year: 2008 ident: 10.1016/j.jcss.2018.03.003_br0120 article-title: The approximability of Max CSP with fixed-value constraints publication-title: J. ACM doi: 10.1145/1391289.1391290 contributor: fullname: Deineko – volume: vol. 7 year: 2001 ident: 10.1016/j.jcss.2018.03.003_br0010 article-title: Complexity Classifications of Boolean Constraint Satisfaction Problems contributor: fullname: Creignou – volume: vol. 7 year: 2017 ident: 10.1016/j.jcss.2018.03.003_br0030 – start-page: 1560 year: 2011 ident: 10.1016/j.jcss.2018.03.003_br0340 article-title: On LP-based approximability for strict CSPs contributor: fullname: Kumar – volume: 48 start-page: 798 year: 2001 ident: 10.1016/j.jcss.2018.03.003_br0250 article-title: Some optimal inapproximability results publication-title: J. ACM doi: 10.1145/502090.502098 contributor: fullname: Håstad – volume: 9 issue: 3 year: 2017 ident: 10.1016/j.jcss.2018.03.003_br0510 article-title: Asking the metaquestions in constraint tractability publication-title: ACM Trans. Comput. Theory doi: 10.1145/3134757 contributor: fullname: Chen – volume: 63 issue: 4 year: 2016 ident: 10.1016/j.jcss.2018.03.003_br0140 article-title: The complexity of finite-valued CSPs publication-title: J. ACM doi: 10.1145/2974019 contributor: fullname: Thapper – volume: 59 start-page: 76 issue: 1 year: 2016 ident: 10.1016/j.jcss.2018.03.003_br0300 article-title: Complexity of approximating CSP with balance/hard constraints publication-title: Theory Comput. Syst. doi: 10.1007/s00224-015-9638-0 contributor: fullname: Guruswami – start-page: 99 year: 2010 ident: 10.1016/j.jcss.2018.03.003_br0210 article-title: On the unique games conjecture contributor: fullname: Khot – year: 1986 ident: 10.1016/j.jcss.2018.03.003_br0450 contributor: fullname: Schrijver – volume: 46 start-page: 1087 issue: 3 year: 2017 ident: 10.1016/j.jcss.2018.03.003_br0130 article-title: The complexity of general-valued CSPs publication-title: SIAM J. Comput. doi: 10.1137/16M1091836 contributor: fullname: Kolmogorov – start-page: 125 year: 2012 ident: 10.1016/j.jcss.2018.03.003_br0430 article-title: Near unanimity constraints have bounded pathwidth duality contributor: fullname: Barto – year: 2015 ident: 10.1016/j.jcss.2018.03.003_br0160 contributor: fullname: Brown-Cohen – volume: 26 start-page: 1019 issue: 5 year: 2016 ident: 10.1016/j.jcss.2018.03.003_br0500 article-title: On algebras with many symmetric operations publication-title: Int. J. Algebra Comput. doi: 10.1142/S0218196716500429 contributor: fullname: Carvalho – start-page: 634 year: 2014 ident: 10.1016/j.jcss.2018.03.003_br0280 article-title: A characterization of strong approximation resistance contributor: fullname: Khot – start-page: 586 year: 2009 ident: 10.1016/j.jcss.2018.03.003_br0360 article-title: How to round any CSP contributor: fullname: Raghavendra – volume: 54 issue: 3 year: 2007 ident: 10.1016/j.jcss.2018.03.003_br0240 article-title: The PCP theorem by gap amplification publication-title: J. ACM doi: 10.1145/1236457.1236459 contributor: fullname: Dinur – volume: 37 start-page: 319 issue: 1 year: 2007 ident: 10.1016/j.jcss.2018.03.003_br0320 article-title: Optimal inapproximability results for Max-Cut and other 2-variable CSPs? publication-title: SIAM J. Sci. Comput. doi: 10.1137/S0097539705447372 contributor: fullname: Khot – year: 2012 ident: 10.1016/j.jcss.2018.03.003_br0370 contributor: fullname: Gärtner – volume: 34 start-page: 720 issue: 3 year: 2005 ident: 10.1016/j.jcss.2018.03.003_br0060 article-title: Classifying complexity of constraints using finite algebras publication-title: SIAM J. Comput. doi: 10.1137/S0097539700376676 contributor: fullname: Bulatov – volume: 45 start-page: 1646 issue: 4 year: 2016 ident: 10.1016/j.jcss.2018.03.003_br0100 article-title: Robust satisfiability of constraint satisfaction problems publication-title: SIAM J. Comput. doi: 10.1137/130915479 contributor: fullname: Barto – volume: 44 start-page: 1 issue: 1 year: 2015 ident: 10.1016/j.jcss.2018.03.003_br0420 article-title: The power of linear programming for general-valued CSPs publication-title: SIAM J. Comput. doi: 10.1137/130945648 contributor: fullname: Kolmogorov – volume: vol. 7 start-page: 287 year: 2017 ident: 10.1016/j.jcss.2018.03.003_br0220 article-title: Approximation algorithms for CSPs contributor: fullname: Makarychev – start-page: 306 year: 2013 ident: 10.1016/j.jcss.2018.03.003_br0200 article-title: Local distribution and the symmetry gap: approximability of multiway partitioning problems contributor: fullname: Ene – volume: 73 start-page: 205 issue: 3 year: 2015 ident: 10.1016/j.jcss.2018.03.003_br0490 article-title: Characterizations of several Maltsev conditions publication-title: Algebra Univers. doi: 10.1007/s00012-015-0327-2 contributor: fullname: Kozik – volume: 52 start-page: 338 year: 2016 ident: 10.1016/j.jcss.2018.03.003_br0440 article-title: A new line of attack on the dichotomy conjecture publication-title: Eur. J. Comb. doi: 10.1016/j.ejc.2015.07.011 contributor: fullname: Kun – volume: 8 year: 2012 ident: 10.1016/j.jcss.2018.03.003_br0310 article-title: Tight bounds on the approximability of Almost-satisfiable Horn SAT and Exact Hitting Set publication-title: Theory Comput. doi: 10.4086/toc.2012.v008a011 contributor: fullname: Guruswami |
| SSID | ssj0011563 |
| Score | 2.3681548 |
| Snippet | We study the approximability of (Finite-)Valued Constraint Satisfaction Problems (VCSPs) with a fixed finite constraint language Γ consisting of finitary... |
| SourceID | crossref elsevier |
| SourceType | Aggregation Database Publisher |
| StartPage | 14 |
| SubjectTerms | Approximation algorithms Constraint satisfaction problem Universal algebra |
| Title | Towards a characterization of constant-factor approximable finite-valued CSPs |
| URI | https://dx.doi.org/10.1016/j.jcss.2018.03.003 |
| Volume | 97 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3NS8MwFA9zu-jBj6k4P0YO3iTaNmnaHrfh2JwbglN2K_looAO34Sp48m83adIxQTx4aht4UH5pXt5L3-_3ALj2OI39LMaICSURwVwg7guGQhUFmApGKTfnHeMJHbyQh1k4q4FexYUxZZXO91ufXnprN3Ln0Lxb5bnh-AZBeThtJKywYZQ3Ah396tXZ6HRfR4-bnwk6RcGVaLgxcNwZW-Y1F2uj2u3HVusU_74_be05_UOw74JF2LHvcwRq2aIJDqpGDNCtyybY21IVPAbjaVkKu4YMio0cs2VbwqWCwkaEBbKtdmCpKv6ZvxkOFVS5iUGRkQDPJOw9P61PwLR_P-0NkOuagAQmpEBSZ1AhlspnkkQ80sjjWOdwEpNESq6Ujui0U0kS4SUi4UKE-p7HHlEs4Dyg-BTUF8tFdgYgS3gkSJxRn3GSxYplHo85pZEK9HRGtAVuKqjSldXGSKuisXlqgE0NsKmHjQJpC4QVmumPGU618_7D7vyfdhdg1zxZ3uAlqBfvH9mVDiAK3gY7t19-230m5jocDSZ6dDjrfgPjzcj5 |
| link.rule.ids | 315,783,787,3513,4509,24128,27581,27936,27937,45597,45675,45691,45886 |
| linkProvider | Elsevier |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1NS8MwGA5DD-rBj6k4P3PwJnFtk6bpUYZj6jYEK-wW8tFAB27DVfDkbzdp2jFBPHgrbQPlSfrmecP7PC8A14GkLMwZRkIZjQiWCslQCRSbJMJUCUqlO-8YjenglTxO4kkL9BotjCurrGO_j-lVtK7vdGs0u4uicBrfKKoOp52FFXaK8k3i-LFd1LdfqzoPy3jqdmo263Kv18oZX-Q1VUvn2R0y73SKf9-d1nac_j7YrakivPNfcwBa-awN9po2DLD-K9tgZ81T8BCMsqoQdgkFVCszZq-1hHMDleeDJfKNdmDlKf5ZvDkFFTSFY6DIGYDnGvZenpdHIOvfZ70BqnsmIIUJKZG2-VOMtQmFJolMLO6Y2QxOY5JqLY2xfM6GlDRVQapSqVRsryULiBGRlBHFx2BjNp_lJwCKVCaKsJyGQpKcGZEHkklKExPZyUxoB9w0UPGFd8bgTcnYlDtguQOWB9j5j3ZA3KDJf8wvt6H7j3Gn_xx3BbYG2WjIhw_jpzOw7Z54BeE52CjfP_ILSyVKeVktlW-oCscw |
| 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=article&rft.atitle=Towards+a+characterization+of+constant-factor+approximable+finite-valued+CSPs&rft.jtitle=Journal+of+computer+and+system+sciences&rft.au=Dalmau%2C+V%C3%ADctor&rft.au=Krokhin%2C+Andrei&rft.au=Manokaran%2C+Rajsekar&rft.date=2018-11-01&rft.issn=0022-0000&rft.volume=97&rft.spage=14&rft.epage=27&rft_id=info:doi/10.1016%2Fj.jcss.2018.03.003&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_jcss_2018_03_003 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0022-0000&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0022-0000&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0022-0000&client=summon |