Journal of Combinatorial Theory Series B
Optimization, approximation, and complexity classes
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Maximum bounded 3-dimensional matching is MAX SNP-complete
Information Processing Letters
One more occurrence of variables makes satisfiability jump from trivial to NP-complete
SIAM Journal on Computing
Delta-Matroids, Jump Systems, and Bisubmodular Polyhedra
SIAM Journal on Discrete Mathematics
Handbook of combinatorics (vol. 1)
Closure properties of constraints
Journal of the ACM (JACM)
On Syntactic versus Computational Views of Approximability
SIAM Journal on Computing
Fanout limitations on constraint systems
Theoretical Computer Science
Complexity classifications of boolean constraint satisfaction problems
Complexity classifications of boolean constraint satisfaction problems
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
The Approximability of Constraint Satisfaction Problems
SIAM Journal on Computing
On the Approximation Properties of Independent Set Problem in Degree 3 Graphs
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Matching: a well-solved class of integer linear programs
Combinatorial optimization - Eureka, you shrink!
Looking for a Version of Schaefer''s Dichotomy Theorem When Each Variable Occurs at Most Twice
Looking for a Version of Schaefer''s Dichotomy Theorem When Each Variable Occurs at Most Twice
A 12-integral relaxation for the A-matching problem
Operations Research Letters
| Hi-index | 0.00 |
We study the approximability of Max Ones when the number of variable occurrences is bounded by a constant. For conservative constraint languages (i.e., when the unary relations are included) we give a complete classification when the number of occurrences is three or more and a partial classification when the bound is two. For the non-conservative case we prove that it is either trivial or equivalent to the corresponding conservative problem under polynomial-time many-one reductions.