liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
The approximability of three-valued MAX CSP
Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory.
Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory.
University of Durham.
2006 (English)In: SIAM journal on computing (Print), ISSN 0097-5397, E-ISSN 1095-7111, Vol. 35, no 6, 1329-1349 p.Article in journal (Refereed) Published
Abstract [en]

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 domain to the variables so as to maximize the number (or the total weight, for the weighted case) of satisfied constraints. This problem is NP-hard in general, and, therefore, it is natural to study how restricting the allowed types of constraints affects the approximability of the problem. It is known that every Boolean (that is, two-valued) MAX CSP with a finite set of allowed constraint types is either solvable exactly in polynomial time or else APX-compIete (and hence can have no polynomial-time approximation scheme unless P = NP). It has been an open problem for several years whether this result can be extended to non-Boolean MAX CSP, which is much more difficult to analyze than the Boolean case. In this paper, we make the first step in this direction by establishing this result for MAX CSP over a three-element domain. Moreover, we present a simple description of all polynomial-time solvable cases of our problem. This description uses the well-known algebraic combinatorial property of supermodularity. We also show that every hard three-valued MAX CSP contains, in a certain specified sense, one of the two basic hard MAX CSPs which are the MAXIMUM k-COLORABLE SUBGRAPH problems for k = 2, 3. © 2006 Society for Industrial and Applied Mathematics.

Place, publisher, year, edition, pages
2006. Vol. 35, no 6, 1329-1349 p.
National Category
Computer Science
Identifiers
URN: urn:nbn:se:liu:diva-36850DOI: 10.1137/S009753970444644XLocal ID: 32763OAI: oai:DiVA.org:liu-36850DiVA: diva2:257699
Available from: 2009-10-10 Created: 2009-10-10 Last updated: 2017-12-13

Open Access in DiVA

No full text

Other links

Publisher's full text

Authority records BETA

Jonsson, PeterKlasson, Mikael

Search in DiVA

By author/editor
Jonsson, PeterKlasson, Mikael
By organisation
The Institute of TechnologyTCSLAB - Theoretical Computer Science Laboratory
In the same journal
SIAM journal on computing (Print)
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 49 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf