๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The approximability of MAX CSP with fixed-value constraints

โœ Scribed by Deineko, Vladimir; Jonsson, Peter; Klasson, Mikael; Krokhin, Andrei

Book ID
121432015
Publisher
Association for Computing Machinery
Year
2008
Tongue
English
Weight
321 KB
Volume
55
Category
Article
ISSN
0004-5411

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The approximability of MAX CSP with fixe
The approximability of MAX CSP with fixed-value constraints
โœ Deineko, Vladimir; Jonsson, Peter; Klasson, Mikael; Krokhin, Andrei ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Association for Computing Machinery ๐ŸŒ English โš– 321 KB

In the maximum constraint satisfaction problem (MAX CSP), one is given a finite collection of (possibly weighted) constraints on overlapping sets of variables, and the goal is to assign values from a given finite domain to the variables so as to maximize the number (or the total weight, for the weig

The Approximability of Three-valued MAX
The Approximability of Three-valued MAX CSP
โœ Jonsson, Peter; Klasson, Mikael; Krokhin, Andrei ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› Society for Industrial and Applied Mathematics ๐ŸŒ English โš– 240 KB