A bounded approximation for the minimum cost 2-sat problem
- 1 December 1992
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 8 (1-6) , 103-117
- https://doi.org/10.1007/bf01758838
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- An efficient algorithm for the “stable roommates” problemPublished by Elsevier ,2004
- The Structure of the Stable Roommate Problem: Efficient Representation and Enumeration of All Stable AssignmentsSIAM Journal on Computing, 1988
- A simple parallel algorithm for finding a satisfying truth assignment to a 2-cnf formulaInformation Processing Letters, 1988
- An efficient algorithm for the “optimal” stable marriageJournal of the ACM, 1987
- Equivalent approximation algorithms for node coverInformation Processing Letters, 1986
- A linear-time approximation algorithm for the weighted vertex cover problemJournal of Algorithms, 1981
- Non deterministic polynomial optimization problems and their approximationsTheoretical Computer Science, 1981
- Structure preserving reductions among convex optimization problemsJournal of Computer and System Sciences, 1980
- On the Complexity of Timetable and Multicommodity Flow ProblemsSIAM Journal on Computing, 1976
- College Admissions and the Stability of MarriageThe American Mathematical Monthly, 1962