Introduction to the Maximum Solution Problem (Q5504706): Difference between revisions

@@ Property / cites work @@
+On Finding Critical Independent and Vertex Sets
@@ Property / cites work: On Finding Critical Independent and Vertex Sets / rank @@
+Normal rank
@@ Property / cites work @@
+Q4258216
@@ Property / cites work: Q4258216 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for NP-complete problems on planar graphs
+Normal rank
@@ Property / cites work @@
+Constraint Satisfaction with Countable Homogeneous Templates
+Normal rank
@@ Property / cites work @@
+A dichotomy theorem for constraint satisfaction problems on a 3-element set
+Normal rank
@@ Property / cites work @@
+Classifying the Complexity of Constraints Using Finite Algebras
+Normal rank
@@ Property / cites work @@
+The complexity of maximal constraint languages
@@ Property / cites work: The complexity of maximal constraint languages / rank @@
+Normal rank
@@ Property / cites work @@
+An Algebraic Characterisation of Complexity for Valued Constraint
+Normal rank
@@ Property / cites work @@
+The complexity of soft constraint satisfaction
@@ Property / cites work: The complexity of soft constraint satisfaction / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of clausal constraints over chains
@@ Property / cites work: Complexity of clausal constraints over chains / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity Classifications of Boolean Constraint Satisfaction Problems
+Normal rank
@@ Property / cites work @@
+On weighted vs unweighted versions of combinatorial optimization problems
+Normal rank
@@ Property / cites work @@
+A new tractable class of constraint satisfaction problems
+Normal rank
@@ Property / cites work @@
+List homomorphisms and circular arc graphs
@@ Property / cites work: List homomorphisms and circular arc graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
+Normal rank
@@ Property / cites work @@
+Automated Reasoning
@@ Property / cites work: Automated Reasoning / rank @@
+Normal rank
@@ Property / cites work @@
+A dichotomy for minimum cost graph homomorphisms
@@ Property / cites work: A dichotomy for minimum cost graph homomorphisms / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum cost and list homomorphisms to semicomplete digraphs
+Normal rank
@@ Property / cites work @@
+Level of repair analysis and minimum cost homomorphisms of graphs
+Normal rank
@@ Property / cites work @@
+On the complexity of H-coloring
@@ Property / cites work: On the complexity of H-coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality
+Normal rank
@@ Property / cites work @@
+Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality
+Normal rank
@@ Property / cites work @@
+Some optimal inapproximability results
@@ Property / cites work: Some optimal inapproximability results / rank @@
+Normal rank
@@ Property / cites work @@
+A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
+Normal rank
@@ Property / cites work @@
+Closure properties of constraints
@@ Property / cites work: Closure properties of constraints / rank @@
+Normal rank
@@ Property / cites work @@
+Tractable constraints on ordered domains
@@ Property / cites work: Tractable constraints on ordered domains / rank @@
+Normal rank
@@ Property / cites work @@
+Boolean constraint satisfaction: Complexity results for optimization problems with arbitrary weights
+Normal rank
@@ Property / cites work @@
+The Approximability of Three-valued MAX CSP
@@ Property / cites work: The Approximability of Three-valued MAX CSP / rank @@
+Normal rank
@@ Property / cites work @@
+MAX ONES Generalized to Larger Domains
@@ Property / cites work: MAX ONES Generalized to Larger Domains / rank @@
+Normal rank
@@ Property / cites work @@
+Generalised Integer Programming Based on Logically Defined Relations
+Normal rank
@@ Property / cites work @@
+The Maximum Solution Problem on Graphs
@@ Property / cites work: The Maximum Solution Problem on Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The Approximability of Constraint Satisfaction Problems
+Normal rank
@@ Property / cites work @@
+Mathematical Foundations of Computer Science 2005
@@ Property / cites work: Mathematical Foundations of Computer Science 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3739182
@@ Property / cites work: Q3739182 / rank @@
+Normal rank
@@ Property / cites work @@
+A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
+Normal rank
@@ Property / cites work @@
+An efficient algorithm for a class of constraint satisfaction problems
+Normal rank
@@ Property / cites work @@
+Finding Critical Independent Sets and Critical Vertex Subsets are Polynomial Problems
+Normal rank
@@ Property / cites work @@
+Linear degree extractors and the inapproximability of max clique and chromatic number
+Normal rank