Exact and approximation algorithms for the maximum constraint satisfaction problem over the point algebra

DOI10.4230/LIPICS.STACS.2013.127MaRDI QIDQ2957877zbMATH OpenOpenAlexFDO

Authors Yoichi Iwata, Yuichi Yoshida

Publication date 30 January 2017

Full work available at URL https://doi.org/10.4230/LIPIcs.STACS.2013.127

zbMATH Keywords

approximation algorithmsconstraint satisfaction problemsexact algorithmspoint algebra

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Approximation algorithms (68W25) Analysis of algorithms (68W40)

Recommendations

• Optimal 2-constraint satisfaction via sum-product algorithms
• scientific article; zbMATH DE number 1303558
• A new algorithm for optimal 2-constraint satisfaction and its implications
• scientific article; zbMATH DE number 6381632
• Near-optimal algorithms for maximum constraint satisfaction problems

Cited in

(3)

• Relation algebras of Sugihara, Belnap, Meyer, and Church
• On exact algorithms for the permutation CSP
• Parameterized complexity of MinCSP over the point algebra

This page was built for publication: Exact and approximation algorithms for the maximum constraint satisfaction problem over the point algebra

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