The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase Max-2-SAT (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1993-2003 (15) 2004-2007 (16) 2008-2016 (16) 2018-2024 (6)
Publication types (Num. hits)
article(24) inproceedings(29)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 27 occurrences of 24 keywords

Results
Found 53 publication records. Showing 53 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
87Michael Lewin, Dror Livnat, Uri Zwick Improved Rounding Techniques for the MAX 2-SAT and MAX DI-CUT Problems. Search on Bibsonomy IPCO The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
85Martin Fürer, Shiva Prasad Kasiviswanathan Exact Max 2-Sat: Easier and Faster. Search on Bibsonomy SOFSEM (1) The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
78Lars Engebretsen, Venkatesan Guruswami Is Constraint Satisfaction Over Two Variables Always Easy? Search on Bibsonomy RANDOM The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
67Arist Kojevnikov, Alexander S. Kulikov A new approach to proving upper bounds for MAX-2-SAT. Search on Bibsonomy SODA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
58Serge Gaspers, Gregory B. Sorkin A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between. Search on Bibsonomy SODA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
49Haiou Shen, Hantao Zhang 0001 Improving exact algorithms for MAX-2-SAT. Search on Bibsonomy Ann. Math. Artif. Intell. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF exact algorithms, propositional satisfiability, maximum satisfiability
45Per Austrin Balanced max 2-sat might not be the hardest. Search on Bibsonomy STOC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Max 2-Sat, inapproximability, unique games conjecture
39Jordi Planes Improved Branch and Bound Algorithms for Max-2-SAT and Weighted Max-2-SAT. Search on Bibsonomy CP The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
36Alexander S. Kulikov, Konstantin Kutzkov New Bounds for MAX-SAT by Clause Learning. Search on Bibsonomy CSR The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
36Carla P. Gomes, Willem Jan van Hoeve, Lucian Leahu The Power of Semidefinite Programming Relaxations for MAX-SAT. Search on Bibsonomy CPAIOR The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
31Daniel Raible 0001, Henning Fernau A New Upper Bound for Max-2-SAT: A Graph-Theoretic Approach. Search on Bibsonomy MFCS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
31Thomas Hofmeister An Approximation Algorithm for MAX-2-SAT with Cardinality Constraint. Search on Bibsonomy ESA The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
29Alexander D. Scott, Gregory B. Sorkin An LP-Designed Algorithm for Constraint Satisfaction. Search on Bibsonomy ESA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
29Ryan Williams 0001 A New Algorithm for Optimal Constraint Satisfaction and Its Implications. Search on Bibsonomy ICALP The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
28Serge Gaspers, Gregory B. Sorkin A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
28Alexander Golovnev New Upper Bounds for MAX-2-SAT and MAX-2-CSP w.r.t. the Average Variable Degree. Search on Bibsonomy IPEC The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
28Serge Gaspers, Gregory B. Sorkin A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
28Alexander D. Scott, Gregory B. Sorkin Linear-programming design and analysis of fast algorithms for Max 2-Sat and Max 2-CSP Search on Bibsonomy CoRR The full citation details ... 2006 DBLP  BibTeX  RDF
28Jens Gramm, Edward A. Hirsch, Rolf Niedermeier, Peter Rossmanith Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT. Search on Bibsonomy Discret. Appl. Math. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
28Jens Gramm, Edward A. Hirsch, Rolf Niedermeier, Peter Rossmanith New Worst-Case Upper Bounds for MAX-2-SAT with Application to MAX-CUT Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2000 DBLP  BibTeX  RDF
27Mihir Bellare, Oded Goldreich 0001, Madhu Sudan 0001 Free Bits, PCPs and Non-Approximability - Towards Tight Results. Search on Bibsonomy FOCS The full citation details ... 1995 DBLP  DOI  BibTeX  RDF free bits, logarithmic randomness, amortized free bits, Max Clique, Max-2-SAT, FGLSS connection, amortized free-bit complexity, amortized free bit complexity, FPCP parameters, triviality results, computational complexity, computational geometry, theorem proving, NP-hardness, NP complete problems, proof systems, chromatic number, PCPs, Max-cut, nonapproximability
26David R. Karger, Rajeev Motwani 0001, Madhu Sudan 0001 Approximate Graph Coloring by Semidefinite Programming Search on Bibsonomy FOCS The full citation details ... 1994 DBLP  DOI  BibTeX  RDF approximate graph coloring, k-colorable graphs, randomized polynomial time algorithm, semidefinite optimization problems, MAX 2-SAT problems, duality relationship, lower bounds, linear programs, semidefinite programming, vertices, chromatic number, MAX CUT, approximation ratio
24Hans van Maaren, Linda van Norden Sums of Squares, Satisfiability and Maximum Satisfiability. Search on Bibsonomy SAT The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
24Amin Coja-Oghlan, Andreas Goerdt, André Lanka, Frank Schädlich Certifying Unsatisfiability of Random 2k-SAT Formulas Using Approximation Techniques. Search on Bibsonomy FCT The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
23Joachim Kneis, Daniel Mölle, Stefan Richter 0001, Peter Rossmanith Algorithms Based on the Treewidth of Sparse Graphs. Search on Bibsonomy WG The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
23Markus Bläser, Bodo Manthey Improved Approximation Algorithms for Max-2SAT with Cardinality Constraint. Search on Bibsonomy ISAAC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
19Joshua Brakensiek, Neng Huang, Uri Zwick Tight approximability of MAX 2-SAT and relatives, under UGC. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
19Joshua Brakensiek, Neng Huang, Uri Zwick Tight approximability of MAX 2-SAT and relatives, under UGC. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
19Hod Wirzberger, Assaf Kalinski, Idan Meirzada, Harel Primack, Yaniv Romano, Chene Tradonsky, Ruti Ben-Shlomi Lightsolver challenges a leading deep learning solver for Max-2-SAT problems. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
19Yan Ru Pei, Haik Manukian, Massimiliano Di Ventra Generating Weighted MAX-2-SAT Instances with Frustrated Loops: an RBM Case Study. Search on Bibsonomy J. Mach. Learn. Res. The full citation details ... 2020 DBLP  BibTeX  RDF
19Yan Ru Pei, Haik Manukian, Massimiliano Di Ventra Generating Weighted MAX-2-SAT Instances of Tunable Difficulty with Frustrated Loops. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
19Matthew B. Hastings Local Maxima and Improved Exact Algorithm for MAX-2-SAT. Search on Bibsonomy Chic. J. Theor. Comput. Sci. The full citation details ... 2018 DBLP  BibTeX  RDF
19Matthew B. Hastings Local Maxima and Improved Exact Algorithm for MAX-2-SAT. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2016 DBLP  BibTeX  RDF
19Matthew B. Hastings Local Maxima and Improved Exact Algorithm for MAX-2-SAT. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
19Shaowei Cai 0001, Zhong Jie, Kaile Su An effective variable selection heuristic in SLS for weighted Max-2-SAT. Search on Bibsonomy J. Heuristics The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
19Andrew M. Sutton, Jareth Day, Frank Neumann 0001 A parameterized runtime analysis of evolutionary algorithms for MAX-2-SAT. Search on Bibsonomy GECCO The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
19XueLin Xu, Zongsheng Gao, Ke Xu 0001 A tighter upper bound for random MAX 2-SAT. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
19Toshihide Ibaraki, Takashi Imamichi, Yuichi Koga, Hiroshi Nagamochi, Koji Nonobe, Mutsunori Yagiura Efficient branch-and-bound algorithms for weighted MAX-2-SAT. Search on Bibsonomy Math. Program. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
19Daniel Binkele-Raible, Henning Fernau A new upper bound for Max-2-SAT: A graph-theoretic approach. Search on Bibsonomy J. Discrete Algorithms The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
19Gintaras Palubeckis A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem. Search on Bibsonomy Appl. Math. Comput. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
19Gregory Z. Gutin, Eun Jung Kim 0002, Stefan Szeider, Anders Yeo Solving MAX-2-SAT Above a Tight Lower Bound Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
19Daniel Raible 0001, Henning Fernau A New Upper Bound for Max-2-Sat: A Graph-Theoretic Approach Search on Bibsonomy CoRR The full citation details ... 2008 DBLP  BibTeX  RDF
19Per Austrin Balanced Max 2-Sat might not be the hardest. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2006 DBLP  BibTeX  RDF
19Haiou Shen, Hantao Zhang 0001 Study of Lower Bound Functions for MAX-2-SAT. Search on Bibsonomy AAAI The full citation details ... 2004 DBLP  BibTeX  RDF
19Monaldo Mastrolilli, Luca Maria Gambardella MAX-2-SAT: How Good Is Tabu Search in the Worst-Case? Search on Bibsonomy AAAI The full citation details ... 2004 DBLP  BibTeX  RDF
19Haiou Shen, Hantao Zhang 0001 Improving Exact Algorithms for MAX-2-SAT. Search on Bibsonomy AI&M The full citation details ... 2004 DBLP  BibTeX  RDF
19Haiou Shen, Hantao Zhang 0001 An Empirical Study of MAX-2-SAT Phase Transitions. Search on Bibsonomy Electron. Notes Discret. Math. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
19Edward A. Hirsch A New Algorithm for MAX-2-SAT. Search on Bibsonomy STACS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
19Edward A. Hirsch A New Algorithm for MAX-2-SAT Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 1999 DBLP  BibTeX  RDF
19Joseph Cheriyan, William H. Cunningham, Levent Tunçel, Yaoguang Wang A linear programming and rounding approach to max 2-sat. Search on Bibsonomy Cliques, Coloring, and Satisfiability The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
18David R. Karger, Rajeev Motwani 0001, Madhu Sudan 0001 Approximate Graph Coloring by Semidefinite Programming. Search on Bibsonomy J. ACM The full citation details ... 1998 DBLP  DOI  BibTeX  RDF approximation algorithms, NP-completeness, randomized algorithms, graph coloring, chromatic number
12Dániel Marx, Igor Razgon Constant Ratio Fixed-Parameter Approximation of the Edge Multicut Problem. Search on Bibsonomy ESA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
12Dorit Aharonov, Daniel Gottesman, Sandy Irani, Julia Kempe The Power of Quantum Systems on a Line. Search on Bibsonomy FOCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #53 of 53 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license