Towards a characterization of constant-factor approximable finite-valued CSPs (Q1671996): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2962988009 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1610.01019 / 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: Complexity of constraints. An overview of current research themes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractable Optimization Problems through Hypergraph-Based Structural Restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries / 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: 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: The complexity of satisfiability problems / 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: The approximability of MAX CSP with fixed-value constraints / 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 Complexity of Finite-Valued CSPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549708 / 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: The complexity of soft constraint satisfaction / 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: Approximation Algorithms for CSPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The PCP theorem by gap amplification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some optimal inapproximability results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every 2-CSP allows nontrivial approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of strong approximation resistance / rank
 
Normal rank
Property / cites work
 
Property / cites work: O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of approximating CSP with balance/hard constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2913811 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Satisfiability for CSPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365139 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549676 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Round Any CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms and Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust algorithms with polynomial loss for near-unanimity CSPs / 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: Q4993594 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of 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: Near Unanimity Constraints Have Bounded Pathwidth Duality / 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: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two new homomorphism dualities and lattice operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial interpolation and the Chinese remainder theorem for algebraic systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of several Maltsev conditions. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On algebras with many symmetric operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asking the Metaquestions in Constraint Tractability / rank
 
Normal rank

Latest revision as of 13:31, 16 July 2024

scientific article
Language Label Description Also known as
English
Towards a characterization of constant-factor approximable finite-valued CSPs
scientific article

    Statements

    Towards a characterization of constant-factor approximable finite-valued CSPs (English)
    0 references
    0 references
    0 references
    0 references
    7 September 2018
    0 references
    constraint satisfaction problem
    0 references
    approximation algorithms
    0 references
    universal algebra
    0 references
    0 references
    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