An Approximation Algorithm for MAX-2-SAT With Cardinality Constraint

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-540-39658-1_29
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Randomized Variants of Johnson's Algorithm for MAX SAT

2011English

A Variable Neighborhood Walksat-Based Algorithm for MAX-SAT Problems

The Scientific World Journal
BiochemistryMedicineGeneticsMolecular BiologyEnvironmental Science
2014English

MiniMaxSAT: An Efficient Weighted Max-Sat Solver

Journal of Artificial Intelligence Research
Artificial Intelligence
2008English

A Max-Sat Solver With Lazy Data Structures

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Parametric RBAC Maintenance via Max-Sat

2018English

An LP-Designed Algorithm for Constraint Satisfaction

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

An Algorithm for the Quadratic Approximation

Journal of Computational and Applied Mathematics
Computational MathematicsApplied Mathematics
1984English

An Improved Deterministic #SAT Algorithm for Small De Morgan Formulas

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

The Power of Semidefinite Programming Relaxations for MAX-SAT

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy