A bounded approximation for the minimum cost 2-sat problem
type: Item
instance of: scholarly article
title: A bounded approximation for the minimum cost 2-sat problem
zbMATH Open document ID: 0753.68048
DOI: 10.1007/BF01758838
author: Dan Gusfield
author: Leonard Pitt
published in: Algorithmica
publication date: 1992-09-27T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90-08
Mathematics Subject Classification ID: 68R05
zbMATH DE Number: 64812
zbMATH Keywords: satisfiability
zbMATH Keywords: stable roommates problem
zbMATH Keywords: approximation algorithm
MaRDI profile type: Publication
cites work: Structure preserving reductions among convex optimization problems
cites work: A linear-time approximation algorithm for the weighted vertex cover problem
cites work: Q3337223
cites work: The complexity of theorem-proving procedures
cites work: On the Complexity of Timetable and Multicommodity Flow Problems
cites work: College Admissions and the Stability of Marriage
cites work: Q4198056
cites work: The Structure of the Stable Roommate Problem: Efficient Representation and Enumeration of All Stable Assignments
cites work: Q3995616
cites work: Equivalent approximation algorithms for node cover
cites work: An efficient algorithm for the “stable roommates” problem
cites work: Reducibility among Combinatorial Problems
cites work: Q4130997
cites work: Non deterministic polynomial optimization problems and their approximations
description: scientific article; zbMATH DE number 64812