Optimization, approximation, and complexity classes
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Completeness in approximation classes
Information and Computation
Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality
Mathematical Programming: Series A and B
Introduction to the theory of complexity
Introduction to the theory of complexity
Logical definability of NP optimization problems
Information and Computation
Approximation properties of NP minimization classes
Journal of Computer and System Sciences
A dichotomy theorem for maximum generalized satisfiability problems
Journal of Computer and System Sciences - Special issue on selected papers presented at the 24th annual ACM symposium on the theory of computing (STOC '92)
Towards a syntactic characterization of PTAS
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Approximation algorithms for Steiner and directed multicuts
Journal of Algorithms
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Improved low-degree testing and its applications
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
On the hardness of approximating minimization problems
Journal of the ACM (JACM)
On the Structure of Polynomial Time Reducibility
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
SIAM Journal on Computing
Structure in Approximation Classes (Extended Abstract)
COCOON '95 Proceedings of the First Annual International Conference on Computing and Combinatorics
Free bits, PCPs and non-approximability-towards tight results
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Gadgets Approximation, and Linear Programming
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Approximation through multicommodity flow
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
The hardness of approximate optima in lattices, codes, and systems of linear equations
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
Approximation algorithms for combinatorial problems
Journal of Computer and System Sciences
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A dichotomy theorem for learning quantified Boolean formulas
COLT '97 Proceedings of the tenth annual conference on Computational learning theory
The approximability of NP-hard problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Finding almost-satisfying assignments
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Design networks with bounded pairwise distance
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
A Dichotomy Theorem for Learning Quantified Boolean Formulas
Machine Learning - Special issue: computational learning theory, COLT '97
Approximating minimum unsatisfiability of linear equations
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
SIGACT news complexity theory column 34
ACM SIGACT News
On the Hamming distance of constraint satisfaction problems
Theoretical Computer Science - Complexity and logic
The Complexity of the Extended GCD Problem
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Optimal Satisfiability for Propositional Calculi and Constraint Satisfaction Problems
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Approximability of the Minimum Bisection Problem: An Algorithmic Challenge
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Approximability of Dense Instances of NEAREST CODEWORD Problem
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
The Complexity of Minimal Satisfiability Problems
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Wavelength rerouting in optical networks, or the Venetian routing problem
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Boolean Formulas are Hard to Learn for most Gate Bases
ALT '99 Proceedings of the 10th International Conference on Algorithmic Learning Theory
Approximating Bounded Degree Instances of NP-Hard Problems
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Wavelength rerouting in optical networks, or the Venetian Routing problem
Journal of Algorithms
Towards ambitious approximation algorithms in stubborn set optimization
Fundamenta Informaticae - Concurrency specification and programming
Polynomial time approximation schemes for dense instances of minimum constraint satisfaction
Random Structures & Algorithms
Optimal satisfiability for propositional calculi and constraint satisfaction problems
Information and Computation
SIGACT news complexity theory column 43
ACM SIGACT News
Fast approximate probabilistically checkable proofs
Information and Computation
New hardness results for congestion minimization and machine scheduling
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Minimum 2SAT-DELETION: Inapproximability results and relations to Minimum Vertex Cover
Discrete Applied Mathematics
Predecessor existence problems for finite discrete dynamical systems
Theoretical Computer Science
On the complexity of global constraint satisfaction
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Towards Ambitious Approximation Algorithms in Stubborn Set Optimization
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2002), Part 1
Hi-index | 0.00 |
This paper continues the work initiated by Creignou, and by Khanna, Sudan and Williamson, who classify maximization problems derived from Boolean constraint satisfaction. Here we study the approximability of minimization problems derived thence. A problem in this framework is characterized by a collection F of ``constraints'' (i.e., functions f:\{0,1\}^k \rightarrow \{0,1\}) and an instance of a problem is constraints drawn from F applied to specified subsets of n Boolean variables. We study the two minimization analogs of classes studied by Khanna et. al.: in one variant, namely MINCSP(F), the objective is to find an assignment to minimize the number of unsatisfied constraints, while in the other, namely MINONES(F), the goal is to find a satisfying assignment with minimum number of ones. These two classes together capture an entire spectrum of important minimization problems including s-t Min Cut, vertex cover, hitting set with bounded size sets, integer programs with two variables per inequality, graph bipartization, clause deletion in CNF formulae, and nearest codeword. Our main result is that there exists a finite partition of the space of all constraint sets such that for any given F, the approximability of MINCSP(F) and MINONES(F) is completely determined by the partition containing it. Moreover, we present a compact set of rules that determines which partition contains a given family F. Our classification identifies the central elements governing the approximability of problems in these classes, by unifying a large collection algorithmic and hardness of approximation results. When contrasted with the work of Khanna et. al., our results also serve to formally highlight inherent differences between maximization and minimization problems.