Approximating a generalization of MAX 2SAT and MIN 2SAT
- 1 December 2000
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 107 (1-3) , 41-59
- https://doi.org/10.1016/s0166-218x(00)00244-4
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUTPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Derandomizing Approximation Algorithms Based on Semidefinite ProgrammingSIAM Journal on Computing, 1999
- Forest Harvesting and Minimum Cuts: A New Approach to Handling Spatial ConstraintsForest Science, 1997
- Approximate Max-Flow Min-(Multi)Cut Theorems and Their ApplicationsSIAM Journal on Computing, 1996
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programmingJournal of the ACM, 1995
- Spatial Optimization for Wildlife and Timber in Managed Forest EcosystemsForest Science, 1992
- On the Complexity of Timetable and Multicommodity Flow ProblemsSIAM Journal on Computing, 1976