Maximum \(H\)-colourable subdigraphs and constraint optimization with arbitrary weights (Q881590): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Andrei A. Krokhin / rank
Normal rank
 
Property / author
 
Property / author: Andrei A. Krokhin / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jcss.2007.02.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2142884756 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semiring-based CSPs and valued CSPs: Frameworks, properties, and comparison / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dichotomy theorem for constraint satisfaction problems on a 3-element set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Learning Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of soft constraint satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Supermodular functions and the complexity of MAX CSP / 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: Q4737176 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learnability of quantified formulas. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of counting homomorphisms seen from the other side / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4530231 / 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: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypertree decompositions and tractable queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: On bounded occurrence constraint satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some optimal inapproximability results / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of H-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boolean constraint satisfaction: Complexity results for optimization problems with arbitrary weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Approximability of Three-valued MAX CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Approximability of Constraint Satisfaction Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjunctive-query containment and constraint satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum Constraint Satisfaction on Diamonds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:20, 25 June 2024

scientific article
Language Label Description Also known as
English
Maximum \(H\)-colourable subdigraphs and constraint optimization with arbitrary weights
scientific article

    Statements

    Maximum \(H\)-colourable subdigraphs and constraint optimization with arbitrary weights (English)
    0 references
    0 references
    0 references
    30 May 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    maximum constraint satisfaction problem
    0 references
    digraph \(H\)-colouring
    0 references
    complexity
    0 references
    dichotomy
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references