The Power of Sherali--Adams Relaxations for General-Valued CSPs (Q5348454): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: JBool / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1606.02577 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards strong nonapproximability results in the Lovász-Schrijver hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Affine systems of equations and counting infinitary logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sum-of-squares proofs and the quest toward optimal algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The collapse of the bounded width hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint Satisfaction Problems Solvable by Local Consistency Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robustly Solvable Constraint Satisfaction Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint Satisfaction Problems with Infinite Templates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudo-Boolean optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial problems raised from 2-semilattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classifying the Complexity of Constraints Using Finite Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of conservative constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs of relational structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Constraint Satisfaction Requires Large LP Relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-optimal algorithms for maximum constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Programming Formulation and Approximation Algorithms for the Metric Labeling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Relaxations and Integrality Gaps / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algebraic Theory of Complexity for Discrete Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of soft constraint satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binarisation for Valued Constraint Satisfaction Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3077976 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dichotomy theorem for maximum generalized satisfiability problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Classifications of Boolean Constraint Satisfaction Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: There are no pure relational width 2 constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a Characterization of Constant-Factor Approximable Min CSPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Satisfiability for CSPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934582 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Distribution and the Symmetry Gap: Approximability of Multiway Partitioning Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Galois Connection for Weighted (Relational) Clones of Infinite Size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrality Gaps of $2-o(1)$ for Vertex Cover SDPs in the Lovász–Schrijver Hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear lower bound on degrees of Positivstellensatz calculus proofs for the parity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete convexity and polynomial solvability in minimum 0-extension problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of finite algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Skew Bisubmodularity and Valued CSPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Half-integrality, LP-branching, and FPT Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closure properties of constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: MAX ONES Generalized to Larger Domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to the Maximum Solution Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Maximum Solution Problem on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Approximability of Constraint Satisfaction Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of General-Valued CSPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Power of Linear Programming for General-Valued CSPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of conservative valued CSPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of several Maltsev conditions. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic Properties of Valued Constraint Satisfaction Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Valued CSPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365139 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear programming, width-1 CSPs, and robust satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new line of attack on the dichotomy conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded width problems and algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Optimization with Polynomials and the Problem of Moments / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cones of Matrices and Set-Functions and 0–1 Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence theorems for weakly symmetric operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549708 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549626 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dichotomy Theorem for the General Minimum Cost Homomorphism Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Necessary Conditions for Tractability of Valued CSPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sherali-Adams Relaxations for Valued CSPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Finite-Valued CSPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: CSP gaps and reductions in the lasserre hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Three-Element Min-Sol and Conservative Min-Cost-Hom / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes via Sherali-Adams hierarchy for dense constraint satisfaction problems and assignment problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 06:10, 14 July 2024

scientific article; zbMATH DE number 6760744
Language Label Description Also known as
English
The Power of Sherali--Adams Relaxations for General-Valued CSPs
scientific article; zbMATH DE number 6760744

    Statements

    The Power of Sherali--Adams Relaxations for General-Valued CSPs (English)
    0 references
    0 references
    0 references
    16 August 2017
    0 references
    valued constraint satisfaction problems
    0 references
    linear programming
    0 references
    Sherali-Adams hierarchy
    0 references
    fractional polymorphisms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references