STACS 2004

DOI10.1007/B96012MaRDI QIDQ5309696zbMATH OpenOpenAlexFDO

Authors M. C. Cooper, Andrei Krokhin, David A. Cohen, P. Jeavons

Publication date 1 October 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Recommendations

• Supermodular functions and the complexity of MAX CSP
• Supermodularity on chains and complexity of maximum constraint satisfaction
• Maximizing Supermodular Functions on Product Lattices, with Application to Maximum Constraint Satisfaction
• Maximum Constraint Satisfaction on Diamonds
• The approximability of MAX CSP with fixed-value constraints

Cited in

(5)

• Supermodular functions and the complexity of MAX CSP
• The approximability of MAX CSP with fixed-value constraints
• Supermodularity on chains and complexity of maximum constraint satisfaction
• Maximizing Supermodular Functions on Product Lattices, with Application to Maximum Constraint Satisfaction
• Max-Sur-CSP on two elements

This page was built for publication: STACS 2004

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5309696)