A new upper bound for Max-2-SAT: A graph-theoretic approach
type: Item
instance of: scholarly article
title: A new upper bound for Max-2-SAT: A graph-theoretic approach
zbMATH Open document ID: 1203.90130
author: Daniel Binkele-Raible
author: Henning Fernau
published in: Journal of Discrete Algorithms
publication date: 2011-01-20T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 5839383
zbMATH Keywords: maximum 2-satisfiability problem
zbMATH Keywords: moderately exponential-time algorithms
zbMATH Keywords: measure and conquer
describes a project that uses: MAX-2-SAT
MaRDI profile type: Publication
full work available at URL: j.jda.2010.06.001
OpenAlex ID: W2001776351
cites work: Searching Trees: An Essay
cites work: A measure & conquer approach for the analysis of exact algorithms
cites work: A universally fastest algorithm for Max 2-sat, Max 2-CSP, and everything in between
cites work: Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT.
cites work: Q2728900
cites work: Algorithms - ESA 2003
cites work: Graph-Theoretic Concepts in Computer Science
cites work: A new approach to proving upper bounds for MAX-2-SAT
cites work: New Bounds for MAX-SAT by Clause Learning
cites work: New upper bounds for the problem of maximal satisfiability
cites work: Q4737518
cites work: Exploiting Cycle Structures in Max-SAT
cites work: Q3624095
cites work: Q5710169
cites work: New Upper Bounds for Maximum Satisfiability
cites work: A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem
cites work: Q4840774
cites work: Linear-programming design and analysis of fast algorithms for Max 2-CSP
cites work: A new algorithm for optimal 2-constraint satisfaction and its implications
cites work: On the Approximation of Maximum Satisfiability
DOI: 10.1016/J.JDA.2010.06.001
Recommended article: A New Upper Bound for Max-2-SAT: A Graph-Theoretic Approach
Recommended article: A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem
Recommended article: Q4938646
Recommended article: New Upper Bounds for Maximum Satisfiability
Recommended article: Q4501522
Recommended article: Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT.
Recommended article: New upper bounds for the problem of maximal satisfiability
Recommended article: New Upper Bounds for MAX-2-SAT and MAX-2-CSP w.r.t. the Average Variable Degree
Recommended article: A tighter upper bound for random MAX \(2\)-SAT
Recommended article: Q4511230
description: scientific article; zbMATH DE number 5839383