scientific article; zbMATH DE number 1552232

MaRDI QIDQ4524463zbMATH OpenFDO

Authors Guillermo Morales Luna, Guillermo de Ita Luna

Publication date 15 January 2001

Full work available at URL http://www.emis.de/proceedings/3ICAOC/

zbMATH Keywords

analysis of intractabilityapproximation algorithmsNP-completeness theory

Mathematics Subject Classification ID

Combinatorics in computer science (68R05)

Recommendations

• scientific article; zbMATH DE number 1258327
• scientific article; zbMATH DE number 1002206
• Approximation algorithms for the maximum satisfiability problem
• scientific article; zbMATH DE number 1302170
• On Some Recent Approximation Algorithms for MAX SAT
• Sums of squares based approximation algorithms for MAX-SAT
• Improved approximation algorithms for MAX SAT
• scientific article; zbMATH DE number 1445292
• On the Approximation of Maximum Satisfiability

Cited in

(23)

• On the hardness of approximating max-satisfy
• Approximating a generalization of MAX 2SAT and MIN 2SAT
• Bounds and fast approximation algorithms for binary quadratic optimzation problems with application to MAX 2SAT
• Approximation algorithms for Max Morse matching
• scientific article; zbMATH DE number 1629855 (Why is no real title available?)
• Simple Approximation Algorithms for Balanced MAX 2SAT
• Near-optimal algorithms for maximum constraint satisfaction problems
• scientific article; zbMATH DE number 6381632 (Why is no real title available?)
• scientific article; zbMATH DE number 1258327 (Why is no real title available?)
• scientific article; zbMATH DE number 1304324 (Why is no real title available?)
• On Approximation Algorithms for Hierarchical MAX-SAT
• scientific article; zbMATH DE number 1979498 (Why is no real title available?)
• An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem
• Approximating MAX SAT by moderately exponential and parameterized algorithms
• Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds
• Complexity and Approximability of Parameterized MAX-CSPs
• A Spectral Method for MAX2SAT in the Planted Solution Model
• On Some Recent Approximation Algorithms for MAX SAT
• Further Reflections on a Theory for Basic Algorithms
• Theory and Applications of Satisfiability Testing
• The maximum feasible subset problem (maxFS) and applications
• MAX SAT approximation beyond the limits of polynomial-time approximation
• Sums of squares based approximation algorithms for MAX-SAT

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4524463)