The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

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

Publication years (Num. hits)
1994-2006 (17) 2007-2018 (5)
Publication types (Num. hits)
article(7) inproceedings(15)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 6 occurrences of 6 keywords

Results
Found 22 publication records. Showing 22 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
151M. Borschbach, A. Exeler A Tabu history driven crossover operator design for memetic algorithm applied to Max-2SAT-problems. Search on Bibsonomy GECCO The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Max-2SAT, tabu search, memetic algorithms
89Markus 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
83Osamu Watanabe 0001, Masaki Yamamoto 0001 Average-Case Analysis for the MAX-2SAT Problem. Search on Bibsonomy SAT The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
76Subhash Khot, Guy Kindler, Elchanan Mossel, Ryan O'Donnell Optimal Inapproximability Results for Max-Cut and Other 2-Variable CSPs? Search on Bibsonomy FOCS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
67Venkatesan Guruswami On 2-Query Codeword Testing with Near-Perfect Completeness. Search on Bibsonomy ISAAC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
61Dorit S. Hochbaum, Anu Pathria Approximating a generalization of MAX 2SAT and MIN 2SAT. Search on Bibsonomy Discret. Appl. Math. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
59Mistuo Motoki Test Instance Generation for MAX 2SAT. Search on Bibsonomy CP The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
58David P. Williamson Gadgets, Approximation, and Linear Programming: Improved Hardness Results for Cut and Satisfiability Problems (Abstract of Invited Lecture). Search on Bibsonomy WG The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
47Howard J. Karloff, Uri Zwick A 7/8-Approximation Algorithm for MAX 3SAT? Search on Bibsonomy FOCS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
44Uriel Feige, Michel X. Goemans Aproximating the Value of Two Prover Proof Systems, With Applications to MAX 2SAT and MAX DICUT. Search on Bibsonomy ISTCS The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
44Michel X. Goemans, David P. Williamson .879-approximation algorithms for MAX CUT and MAX 2SAT. Search on Bibsonomy STOC The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
43Kuen-Lin Yu, Chung-Shou Liao, D. T. Lee Maximizing the Number of Independent Labels in the Plane. Search on Bibsonomy FAW The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
35Piotr Berman, Marek Karpinski On Some Tighter Inapproximability Results (Extended Abstract). Search on Bibsonomy ICALP The full citation details ... 1999 DBLP  DOI  BibTeX  RDF Approximation Hardness, Bounded Dependency Satisfiability, Breakpoint Graphs, Node Cover, Approximation Algorithms, Independent Set, MAX-CUT, Sorting by Reversals
35Alice Paul, Matthias Poloczek, David P. Williamson Simple Approximation Algorithms for Balanced MAX 2SAT. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
35Alice Paul, Matthias Poloczek, David P. Williamson Simple Approximation Algorithms for Balanced MAX 2SAT. Search on Bibsonomy LATIN The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
35Osamu Watanabe 0001, Masaki Yamamoto 0001 Average-case analysis for the MAX-2SAT problem. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
35Pierre Bonami, Michel Minoux Exact MAX-2SAT solution via lift-and-project closure. Search on Bibsonomy Oper. Res. Lett. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
35Moses Charikar, Konstantin Makarychev, Yury Makarychev Note on MAX 2SAT. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2006 DBLP  BibTeX  RDF
35Hans van Maaren, Joost P. Warners Bounds and fast approximation algorithms for binary quadratic optimization problems with application to MAX 2SAT. Search on Bibsonomy Discret. Appl. Math. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
35Maria Alberta Alberti, Alberto Bertoni, Paola Campadelli, Giuliano Grossi, Roberto Posenato A Neural Algorithm for MAX-2SAT: Performance Analysis and Circuit Implementation. Search on Bibsonomy Neural Networks The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
24Vineet Bafna, Vikas Bansal 0001 Improved Recombination Lower Bounds for Haplotype Data. Search on Bibsonomy RECOMB The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
24Takao Asano, Magnús M. Halldórsson, Kazuo Iwama, Takeshi Matsuda Approximation Algorithms for the Maximum Power Consumption Problem on Combinatorial Circuits. Search on Bibsonomy ISAAC The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #22 of 22 (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