Search results for "Max-2SAT"

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