Maximum Constraint Satisfaction on Diamonds

DOI10.1007/11564751_30zbMath1153.68469OpenAlexW1561229603MaRDI QIDQ3524191

Benoit Larose, Andrei A. Krokhin

Publication date: 9 September 2008

Published in: Principles and Practice of Constraint Programming - CP 2005 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11564751_30

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (3)

Hard constraint satisfaction problems have hard gaps at location 1 ⋮ Maximum \(H\)-colourable subdigraphs and constraint optimization with arbitrary weights ⋮ Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms

This page was built for publication: Maximum Constraint Satisfaction on Diamonds