A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between
In this paper we introduce “hybrid” Max 2-CSP formulas consisting of “simple clauses”, namely conjunctions and disjunctions of pairs of variables, and general 2-variable clauses, which can be any integer-valued functions of pairs of boolean variables. This allows an algorithm to use both efficient r...
Uložené v:
| Vydané v: | Journal of computer and system sciences Ročník 78; číslo 1; s. 305 - 335 |
|---|---|
| Hlavní autori: | , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Elsevier Inc
2012
|
| Predmet: | |
| ISSN: | 0022-0000, 1090-2724 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | In this paper we introduce “hybrid” Max 2-CSP formulas consisting of “simple clauses”, namely conjunctions and disjunctions of pairs of variables, and general 2-variable clauses, which can be any integer-valued functions of pairs of boolean variables. This allows an algorithm to use both efficient reductions specific to AND and OR clauses, and other powerful reductions that require the general CSP setting. We use new reductions introduced here, and recent reductions such as “clause-learning” and “2-reductions” generalized to our settingʼs mixture of simple and general clauses. We parametrize a hybrid instance by the fraction
p of non-simple clauses. We give an exact, exponential-time but polynomial-space algorithm that is the fastest known for
p
=
0
, which includes the well-studied Max 2-Sat problem but also instances with arbitrary mixtures of AND and OR clauses; for an
m-clause instance it runs in time
O
⋆
(
2
m
/
6.321
)
. The same algorithm is tied for fastest for general Max 2-CSP (
p
=
1
), with running time
O
⋆
(
2
m
/
5.263
)
. The algorithm is the only one to treat mixtures of AND, OR, and general integer-valued clauses more efficiently than the general case, with intermediate running time bounds depending on the value of
p. Since even a pure Max 2-Sat input instance may be transformed to a hybrid instance in the course of solving it, the algorithmʼs efficiency and generality go hand in hand. Our algorithm analysis and optimization use the familiar measure-and-conquer approach, but in a variation resulting in mathematical programs that are convex rather than quasi-convex, and can be solved efficiently and with a certificate of optimality. We produce a family of running-time upper-bound formulas, each optimized for instances with a particular value of
p but valid for all instances. |
|---|---|
| AbstractList | In this paper we introduce "hybrid" Max 2-CSP formulas consisting of "simple clauses", namely conjunctions and disjunctions of pairs of variables, and general 2-variable clauses, which can be any integer-valued functions of pairs of boolean variables. This allows an algorithm to use both efficient reductions specific to AND and OR clauses, and other powerful reductions that require the general CSP setting. We use new reductions introduced here, and recent reductions such as "clause-learning" and "2-reductions" generalized to our settingE14s mixture of simple and general clauses. We parametrize a hybrid instance by the fraction p of non-simple clauses. We give an exact, exponential-time but polynomial-space algorithm that is the fastest known for p=0, which includes the well-studied Max 2-Sat problem but also instances with arbitrary mixtures of AND and OR clauses; for an m-clause instance it runs in time O super(a<() super(2)m/6.321). The same algorithm is tied for fastest for general Max 2-CSP (p=1), with running time O super(a<() super(2)m/5.263). The algorithm is the only one to treat mixtures of AND, OR, and general integer-valued clauses more efficiently than the general case, with intermediate running time bounds depending on the value of p. Since even a pure Max 2-Sat input instance may be transformed to a hybrid instance in the course of solving it, the algorithmE14s efficiency and generality go hand in hand. Our algorithm analysis and optimization use the familiar measure-and-conquer approach, but in a variation resulting in mathematical programs that are convex rather than quasi-convex, and can be solved efficiently and with a certificate of optimality. We produce a family of running-time upper-bound formulas, each optimized for instances with a particular value of p but valid for all instances. In this paper we introduce “hybrid” Max 2-CSP formulas consisting of “simple clauses”, namely conjunctions and disjunctions of pairs of variables, and general 2-variable clauses, which can be any integer-valued functions of pairs of boolean variables. This allows an algorithm to use both efficient reductions specific to AND and OR clauses, and other powerful reductions that require the general CSP setting. We use new reductions introduced here, and recent reductions such as “clause-learning” and “2-reductions” generalized to our settingʼs mixture of simple and general clauses. We parametrize a hybrid instance by the fraction p of non-simple clauses. We give an exact, exponential-time but polynomial-space algorithm that is the fastest known for p = 0 , which includes the well-studied Max 2-Sat problem but also instances with arbitrary mixtures of AND and OR clauses; for an m-clause instance it runs in time O ⋆ ( 2 m / 6.321 ) . The same algorithm is tied for fastest for general Max 2-CSP ( p = 1 ), with running time O ⋆ ( 2 m / 5.263 ) . The algorithm is the only one to treat mixtures of AND, OR, and general integer-valued clauses more efficiently than the general case, with intermediate running time bounds depending on the value of p. Since even a pure Max 2-Sat input instance may be transformed to a hybrid instance in the course of solving it, the algorithmʼs efficiency and generality go hand in hand. Our algorithm analysis and optimization use the familiar measure-and-conquer approach, but in a variation resulting in mathematical programs that are convex rather than quasi-convex, and can be solved efficiently and with a certificate of optimality. We produce a family of running-time upper-bound formulas, each optimized for instances with a particular value of p but valid for all instances. |
| Author | Sorkin, Gregory B. Gaspers, Serge |
| Author_xml | – sequence: 1 givenname: Serge surname: Gaspers fullname: Gaspers, Serge email: gaspers@kr.tuwien.ac.at organization: Institute of Information Systems (184/3), Vienna University of Technology, Favoritenstrasse 9-11, A-1040 Vienna, Austria – sequence: 2 givenname: Gregory B. surname: Sorkin fullname: Sorkin, Gregory B. email: g.b.sorkin@lse.ac.uk organization: Department of Management, London School of Economics, Houghton Street, London WC2A 2AE, UK |
| BookMark | eNp9kD1PwzAQhi0EEi3wB5g8MjTh7Hw4llhQxZcEAqkwW8a5gKPUAdst9N_jqkwM3HI3PM_p7p2SfTc6JOSUQc6A1ed93psQcg6M5VDlwGCPTBhIyLjg5T6ZAHCeQapDMg2hhwRWdTEhi0u6cnaNPuhh2NBOh4ghUj28jd7G9yXtRk8f9Dfl2ULH2e84XzzNqHYtxWRu4rt1b9Q6-orxC9Edk4NODwFPfvsRebm-ep7fZvePN3fzy_vMFFLGjIkCTNuJGlFWRoKRspa85iW2dSWgbCooGiN50zEmmUABvCqZ0GXZdZyXrDgiZ7u9H378XKWz1dIGg8OgHY6roFIy0Iim4ZBQvkONH0Pw2KkPb5fabxK05WrVq22CapuggkolNUnNH8nYqKMdXfTaDv-rFzsV0_9ri14FY9EZbK1HE1U72v_0H1rZi0c |
| CitedBy_id | crossref_primary_10_1002_jgt_22179 crossref_primary_10_1007_s00453_022_01034_7 crossref_primary_10_1016_j_tcs_2017_07_011 crossref_primary_10_1007_s00453_014_9883_7 crossref_primary_10_1016_j_jcss_2015_11_013 crossref_primary_10_1137_16M107712X crossref_primary_10_1007_s00453_013_9759_2 crossref_primary_10_1007_s00224_014_9600_6 crossref_primary_10_1016_j_tcs_2014_01_010 crossref_primary_10_1145_3111499 |
| Cites_doi | 10.1145/1552285.1552286 10.1016/j.jalgor.2004.06.008 10.1145/1198513.1198515 10.1016/j.ipl.2005.11.013 10.1016/j.disopt.2007.08.001 10.1016/j.jalgor.2004.01.001 10.1016/S0304-3975(98)00017-6 10.1016/S0166-218X(02)00402-X 10.1016/j.tcs.2005.09.023 10.1006/jagm.2000.1075 |
| ContentType | Journal Article |
| Copyright | 2011 Elsevier Inc. |
| Copyright_xml | – notice: 2011 Elsevier Inc. |
| DBID | 6I. AAFTH AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D |
| DOI | 10.1016/j.jcss.2011.05.010 |
| DatabaseName | ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Computer and Information Systems Abstracts |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science |
| EISSN | 1090-2724 |
| EndPage | 335 |
| ExternalDocumentID | 10_1016_j_jcss_2011_05_010 S0022000011000596 |
| 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- 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO ADVLN AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD 7SC 8FD JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c399t-1730cdf76ee95c90c99692624ed6570485038c928f11917e7025417a44ff22413 |
| ISICitedReferencesCount | 21 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000297833200022&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0022-0000 |
| IngestDate | Sat Sep 27 23:48:11 EDT 2025 Sat Nov 29 04:16:27 EST 2025 Tue Nov 18 22:36:12 EST 2025 Fri Feb 23 02:19:41 EST 2024 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Keywords | Hybrid instances Exponential-time algorithm Constraint satisfaction Measure and conquer Polynomial space Convex programming Satisfiability |
| Language | English |
| License | http://www.elsevier.com/open-access/userlicense/1.0 https://www.elsevier.com/tdm/userlicense/1.0 https://www.elsevier.com/open-access/userlicense/1.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c399t-1730cdf76ee95c90c99692624ed6570485038c928f11917e7025417a44ff22413 |
| Notes | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
| OpenAccessLink | https://dx.doi.org/10.1016/j.jcss.2011.05.010 |
| PQID | 1010878820 |
| PQPubID | 23500 |
| PageCount | 31 |
| ParticipantIDs | proquest_miscellaneous_1010878820 crossref_primary_10_1016_j_jcss_2011_05_010 crossref_citationtrail_10_1016_j_jcss_2011_05_010 elsevier_sciencedirect_doi_10_1016_j_jcss_2011_05_010 |
| PublicationCentury | 2000 |
| PublicationDate | 2012 2012-01-00 20120101 |
| PublicationDateYYYYMMDD | 2012-01-01 |
| PublicationDate_xml | – year: 2012 text: 2012 |
| PublicationDecade | 2010 |
| PublicationTitle | Journal of computer and system sciences |
| PublicationYear | 2012 |
| Publisher | Elsevier Inc |
| Publisher_xml | – name: Elsevier Inc |
| References | Alexander D. Scott, Gregory B. Sorkin, A faster exponential-time algorithm for Max 2-Sat, Max Cut, and Max Koivisto (br0120) 2006; 98 Cut, Tech. Report RC23456 (W0412-001), IBM Research Report, December 2004, see Eppstein (br0040) 2006; 2 Joachim Kneis, Peter Rossmanith, A new satisfiability algorithm with applications to Max-Cut, Tech. Report AIB-2005-08, Department of Computer Science, RWTH Aachen, 2005. Hirsch (br0080) 2000; vol. 1770 Kullmann (br0150) 1999; 223 Bonsma, Lokshtanov (br0020) 2011; vol. 6844 Kullmann (br0140) 1997; vol. 35 Scott, Sorkin (br0180) 2003; vol. 2764 Raible, Fernau (br0170) 2008; vol. 5162 Williams (br0230) 2005; 348 Bansal, Raman (br0030) 1999; vol. 1741 Scott, Sorkin (br0200) 2007; 4 Gaspers, Sorkin (br0070) 2009 Kojevnikov, Kulikov (br0090) 2006 Gramm, Hirsch, Niedermeier, Rossmanith (br0060) 2003; 130 Niedermeier, Rossmanith (br0160) 2000; 36 Wahlström (br0220) 2004; 51 Beigel, Eppstein (br0010) 2005; 54 Kulikov, Kutzkov (br0100) 2007; vol. 4649 . Kneis, Mölle, Richter, Rossmanith (br0110) 2005; vol. 3787 Fomin, Grandoni, Kratsch (br0050) 2009; 56 Alexander D. Scott, Gregory B. Sorkin, Polynomial constraint satisfaction: A framework for counting and sampling CSPs and other problems, Tech. Report cs:DM/0604079v3, arxiv.org, February 2007, see Niedermeier (10.1016/j.jcss.2011.05.010_br0160) 2000; 36 Williams (10.1016/j.jcss.2011.05.010_br0230) 2005; 348 Kulikov (10.1016/j.jcss.2011.05.010_br0100) 2007; vol. 4649 Fomin (10.1016/j.jcss.2011.05.010_br0050) 2009; 56 Eppstein (10.1016/j.jcss.2011.05.010_br0040) 2006; 2 Scott (10.1016/j.jcss.2011.05.010_br0180) 2003; vol. 2764 Wahlström (10.1016/j.jcss.2011.05.010_br0220) 2004; 51 Beigel (10.1016/j.jcss.2011.05.010_br0010) 2005; 54 Kullmann (10.1016/j.jcss.2011.05.010_br0140) 1997; vol. 35 Hirsch (10.1016/j.jcss.2011.05.010_br0080) 2000; vol. 1770 Bonsma (10.1016/j.jcss.2011.05.010_br0020) 2011; vol. 6844 Gaspers (10.1016/j.jcss.2011.05.010_br0070) 2009 Gramm (10.1016/j.jcss.2011.05.010_br0060) 2003; 130 Kneis (10.1016/j.jcss.2011.05.010_br0110) 2005; vol. 3787 Raible (10.1016/j.jcss.2011.05.010_br0170) 2008; vol. 5162 Scott (10.1016/j.jcss.2011.05.010_br0200) 2007; 4 Bansal (10.1016/j.jcss.2011.05.010_br0030) 1999; vol. 1741 Kullmann (10.1016/j.jcss.2011.05.010_br0150) 1999; 223 Kojevnikov (10.1016/j.jcss.2011.05.010_br0090) 2006 10.1016/j.jcss.2011.05.010_br0190 Koivisto (10.1016/j.jcss.2011.05.010_br0120) 2006; 98 10.1016/j.jcss.2011.05.010_br0130 10.1016/j.jcss.2011.05.010_br0210 |
| References_xml | – volume: 36 start-page: 63 year: 2000 end-page: 88 ident: br0160 article-title: New upper bounds for maximum satisfiability publication-title: J. Algorithms – volume: 2 start-page: 492 year: 2006 end-page: 509 ident: br0040 article-title: Quasiconvex analysis of multivariate recurrence equations for backtracking algorithms publication-title: ACM Trans. Algorithms – start-page: 11 year: 2006 end-page: 17 ident: br0090 article-title: A new approach to proving upper bounds for MAX-2-SAT publication-title: Proceedings of the 17th Annual ACM–SIAM Symposium on Discrete Algorithms (SODA 2006) – volume: 348 start-page: 357 year: 2005 end-page: 365 ident: br0230 article-title: A new algorithm for optimal 2-constraint satisfaction and its implications publication-title: Theoret. Comput. Sci. – volume: vol. 1770 start-page: 65 year: 2000 end-page: 73 ident: br0080 article-title: A new algorithm for MAX-2-SAT publication-title: Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2000) – volume: vol. 1741 start-page: 247 year: 1999 end-page: 258 ident: br0030 article-title: Upper bounds for MaxSat: Further improved publication-title: Proceedings of the 10th International Symposium on Algorithms and Computation (ISAAC 1999) – volume: 98 start-page: 24 year: 2006 end-page: 28 ident: br0120 article-title: Optimal 2-constraint satisfaction via sum-product algorithms publication-title: Inform. Process. Lett. – volume: 56 start-page: 1 year: 2009 end-page: 32 ident: br0050 article-title: A measure & conquer approach for the analysis of exact algorithms publication-title: J. ACM – volume: 130 start-page: 139 year: 2003 end-page: 155 ident: br0060 article-title: Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT publication-title: Discrete Appl. Math. – volume: vol. 4649 start-page: 194 year: 2007 end-page: 204 ident: br0100 article-title: New bounds for MAX-SAT by clause learning publication-title: Proceedings of the 2nd International Symposium on Computer Science in Russia (CSR 2007) – volume: vol. 2764 start-page: 382 year: 2003 end-page: 395 ident: br0180 article-title: Faster algorithms for MAX CUT and MAX CSP, with polynomial expected time for sparse instances publication-title: Proceedings of the 7th International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM 2003) – start-page: 606 year: 2009 end-page: 615 ident: br0070 article-title: A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between publication-title: Proceedings of the 20th annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009) – reference: Alexander D. Scott, Gregory B. Sorkin, Polynomial constraint satisfaction: A framework for counting and sampling CSPs and other problems, Tech. Report cs:DM/0604079v3, arxiv.org, February 2007, see – reference: Alexander D. Scott, Gregory B. Sorkin, A faster exponential-time algorithm for Max 2-Sat, Max Cut, and Max – volume: vol. 3787 start-page: 385 year: 2005 end-page: 396 ident: br0110 article-title: Algorithms based on the treewidth of sparse graphs publication-title: Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2005) – volume: vol. 5162 start-page: 551 year: 2008 end-page: 562 ident: br0170 article-title: A new upper bound for Max-2-SAT: A graph-theoretic approach publication-title: Proceedings of the 33rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2008) – reference: -Cut, Tech. Report RC23456 (W0412-001), IBM Research Report, December 2004, see – volume: vol. 35 year: 1997 ident: br0140 article-title: Worst-Case Analysis, 3-SAT Decision and Lower Bounds: Approaches for Improved SAT Algorithms publication-title: DIMACS Ser. Discrete Math. Theoret. Comput. Sci. – reference: Joachim Kneis, Peter Rossmanith, A new satisfiability algorithm with applications to Max-Cut, Tech. Report AIB-2005-08, Department of Computer Science, RWTH Aachen, 2005. – volume: 4 start-page: 260 year: 2007 end-page: 287 ident: br0200 article-title: Linear-programming design and analysis of fast algorithms for Max 2-CSP publication-title: Discrete Optim. – volume: 51 start-page: 107 year: 2004 end-page: 121 ident: br0220 article-title: Exact algorithms for finding minimum transversals in rank-3 hypergraphs publication-title: J. Algorithms – volume: 54 start-page: 168 year: 2005 end-page: 204 ident: br0010 article-title: 3-coloring in time O( publication-title: J. Algorithms – volume: vol. 6844 start-page: 122 year: 2011 end-page: 133 ident: br0020 article-title: Feedback vertex set in mixed graphs publication-title: Proceedings of the 12th Algorithms and Data Structures Symposium (WADS 2011) – volume: 223 start-page: 1 year: 1999 end-page: 72 ident: br0150 article-title: New methods for 3-SAT decision and worst-case analysis publication-title: Theoret. Comput. Sci. – reference: . – volume: vol. 1741 start-page: 247 year: 1999 ident: 10.1016/j.jcss.2011.05.010_br0030 article-title: Upper bounds for MaxSat: Further improved – volume: 56 start-page: 1 issue: 5 year: 2009 ident: 10.1016/j.jcss.2011.05.010_br0050 article-title: A measure & conquer approach for the analysis of exact algorithms publication-title: J. ACM doi: 10.1145/1552285.1552286 – volume: 54 start-page: 168 issue: 2 year: 2005 ident: 10.1016/j.jcss.2011.05.010_br0010 article-title: 3-coloring in time O(1.3289n) publication-title: J. Algorithms doi: 10.1016/j.jalgor.2004.06.008 – volume: 2 start-page: 492 issue: 4 year: 2006 ident: 10.1016/j.jcss.2011.05.010_br0040 article-title: Quasiconvex analysis of multivariate recurrence equations for backtracking algorithms publication-title: ACM Trans. Algorithms doi: 10.1145/1198513.1198515 – start-page: 11 year: 2006 ident: 10.1016/j.jcss.2011.05.010_br0090 article-title: A new approach to proving upper bounds for MAX-2-SAT – volume: vol. 35 year: 1997 ident: 10.1016/j.jcss.2011.05.010_br0140 article-title: Worst-Case Analysis, 3-SAT Decision and Lower Bounds: Approaches for Improved SAT Algorithms – volume: vol. 1770 start-page: 65 year: 2000 ident: 10.1016/j.jcss.2011.05.010_br0080 article-title: A new algorithm for MAX-2-SAT – volume: 98 start-page: 24 issue: 1 year: 2006 ident: 10.1016/j.jcss.2011.05.010_br0120 article-title: Optimal 2-constraint satisfaction via sum-product algorithms publication-title: Inform. Process. Lett. doi: 10.1016/j.ipl.2005.11.013 – start-page: 606 year: 2009 ident: 10.1016/j.jcss.2011.05.010_br0070 article-title: A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between – volume: vol. 3787 start-page: 385 year: 2005 ident: 10.1016/j.jcss.2011.05.010_br0110 article-title: Algorithms based on the treewidth of sparse graphs – volume: vol. 2764 start-page: 382 year: 2003 ident: 10.1016/j.jcss.2011.05.010_br0180 article-title: Faster algorithms for MAX CUT and MAX CSP, with polynomial expected time for sparse instances – volume: vol. 6844 start-page: 122 year: 2011 ident: 10.1016/j.jcss.2011.05.010_br0020 article-title: Feedback vertex set in mixed graphs – ident: 10.1016/j.jcss.2011.05.010_br0130 – volume: 4 start-page: 260 issue: 3–4 year: 2007 ident: 10.1016/j.jcss.2011.05.010_br0200 article-title: Linear-programming design and analysis of fast algorithms for Max 2-CSP publication-title: Discrete Optim. doi: 10.1016/j.disopt.2007.08.001 – volume: 51 start-page: 107 issue: 2 year: 2004 ident: 10.1016/j.jcss.2011.05.010_br0220 article-title: Exact algorithms for finding minimum transversals in rank-3 hypergraphs publication-title: J. Algorithms doi: 10.1016/j.jalgor.2004.01.001 – volume: 223 start-page: 1 issue: 1–2 year: 1999 ident: 10.1016/j.jcss.2011.05.010_br0150 article-title: New methods for 3-SAT decision and worst-case analysis publication-title: Theoret. Comput. Sci. doi: 10.1016/S0304-3975(98)00017-6 – volume: 130 start-page: 139 issue: 2 year: 2003 ident: 10.1016/j.jcss.2011.05.010_br0060 article-title: Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT publication-title: Discrete Appl. Math. doi: 10.1016/S0166-218X(02)00402-X – volume: vol. 5162 start-page: 551 year: 2008 ident: 10.1016/j.jcss.2011.05.010_br0170 article-title: A new upper bound for Max-2-SAT: A graph-theoretic approach – volume: vol. 4649 start-page: 194 year: 2007 ident: 10.1016/j.jcss.2011.05.010_br0100 article-title: New bounds for MAX-SAT by clause learning – ident: 10.1016/j.jcss.2011.05.010_br0190 – volume: 348 start-page: 357 issue: 2–3 year: 2005 ident: 10.1016/j.jcss.2011.05.010_br0230 article-title: A new algorithm for optimal 2-constraint satisfaction and its implications publication-title: Theoret. Comput. Sci. doi: 10.1016/j.tcs.2005.09.023 – ident: 10.1016/j.jcss.2011.05.010_br0210 – volume: 36 start-page: 63 issue: 1 year: 2000 ident: 10.1016/j.jcss.2011.05.010_br0160 article-title: New upper bounds for maximum satisfiability publication-title: J. Algorithms doi: 10.1006/jagm.2000.1075 |
| SSID | ssj0011563 |
| Score | 2.0966547 |
| Snippet | In this paper we introduce “hybrid” Max 2-CSP formulas consisting of “simple clauses”, namely conjunctions and disjunctions of pairs of variables, and general... In this paper we introduce "hybrid" Max 2-CSP formulas consisting of "simple clauses", namely conjunctions and disjunctions of pairs of variables, and general... |
| SourceID | proquest crossref elsevier |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 305 |
| SubjectTerms | Algorithms Boolean algebra Computational efficiency Constraint satisfaction Convex programming Exponential-time algorithm Hybrid instances Mathematical analysis Mathematical models Measure and conquer Optimization Polynomial space Reduction Running Satisfiability |
| Title | A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between |
| URI | https://dx.doi.org/10.1016/j.jcss.2011.05.010 https://www.proquest.com/docview/1010878820 |
| Volume | 78 |
| WOSCitedRecordID | wos000297833200022&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1090-2724 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0011563 issn: 0022-0000 databaseCode: AIEXJ dateStart: 19950201 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1bb9MwFLag4wEeuAwQ4yYj8ZZlctKkjh_LNG6CaVKH1DfLcRzWqqRTk6Lu33OO7aRh0yZA4iVKo5yk8vlyfHwunwl5mxajPIdvKBSY2k3EKApzlrNQ69LoImGFFrZR-As_Ps6mU3Hio0q13U6AV1W22Yjz_6pquAbKxtbZv1B391C4AOegdDiC2uH4R4ofB2tXbKEWi4ugVKDGGuO635erWXP2w9YVflWbIA4nyrfr4I_DyUlbyWlA-qI5890uvpLrGi9W-10hrKCjhQ78rNp56x8U0pFbwEyw2bOL6thAfa9TJnh30I9CRNvVatcY81vdpm0SwLnQTTPOtjLBwpi7lunW-PLsCsicJR2ytDcpDx2nyRV770IP84O5rmvPx4o0rGw7u3U1h5iWjm0yI7KsNKPbZCfmqWADsjP-dDT93CWfYEk7bEnmUcD3WrmywMtvus6fuTSzW3fl9CG57zVExw4fj8gtU-2SB-0eHtSb9F1yr0dI-ZhMxrQHHurBQzvwUAAPBbxQC559fwrQ2aegf7oFDp1V1APnCfn2_uj08GPot90INXirTRiB0ddFyUfGiFQLpmFJjKySiSmwTirJkEFIizgrkRyQG46EChFXSVKWNk37lAyqZWWeEfibZVRy-NyRNw6W6jncIBKhEs2LSOXJHonawZPac9Lj1igL2RYfziUOuMQBlyyVMOB7JOhkzh0jy413p61OpEe_8xUlQOhGuTetAiUYXMyiqcos1zUKsIzDwpQ9_8dnvyB38RNygbyXZNCs1uYVuaN_NrN69dqj8ReWqaQo |
| linkProvider | Elsevier |
| 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=A+universally+fastest+algorithm+for+Max+2-Sat%2C+Max+2-CSP%2C+and+everything+in+between&rft.jtitle=Journal+of+computer+and+system+sciences&rft.au=Gaspers%2C+Serge&rft.au=Sorkin%2C+Gregory+B.&rft.date=2012&rft.pub=Elsevier+Inc&rft.issn=0022-0000&rft.eissn=1090-2724&rft.volume=78&rft.issue=1&rft.spage=305&rft.epage=335&rft_id=info:doi/10.1016%2Fj.jcss.2011.05.010&rft.externalDocID=S0022000011000596 |
| 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 |