Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Help & Advice
University of Warwick

The Library

  • Login
  • Admin

The approximability of MAX CSP with fixed-value constraints

Tools
- Tools
+ Tools

Deineko, Vladimir G., Jonsson, P., Klasson, Mikael and Krokhin, Andrei (2008) The approximability of MAX CSP with fixed-value constraints. Association for Computing Machinery Journal, Vol.55 (No.4). doi:10.1145/1391289.1391290 ISSN 0004-5411.

Research output not available from this repository.

Request-a-Copy directly from author or use local Library Get it For Me service.

Official URL: http://dx.doi.org/10.1145/1391289.1391290

Request Changes to record.

Abstract

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 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. In this article, we show that any MAX CSP problem with a finite set of allowed constraint types, which includes all fixed-value constraints (i. e., constraints of the form x = a), is either solvable exactly in polynomial time or else is APX-complete, even if the number of occurrences of variables in instances is bounded. Moreover, we present a simple description of all polynomial-time solvable cases of our problem. This description relies on the well-known algebraic combinatorial property of supermodularity.

Item Type: Journal Article
Subjects: Q Science > QA Mathematics
Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Divisions: Faculty of Social Sciences > Warwick Business School > Operational Research & Management Sciences
Faculty of Social Sciences > Warwick Business School
Library of Congress Subject Headings (LCSH): Algorithms, Computational complexity, Approximation theory, Combinatorial optimization
Journal or Publication Title: Association for Computing Machinery Journal
Publisher: Association for Computing Machinery, Inc.
ISSN: 0004-5411
Official Date: September 2008
Dates:
DateEvent
September 2008Published
Volume: Vol.55
Number: No.4
Number of Pages: 37
DOI: 10.1145/1391289.1391290
Status: Peer Reviewed
Publication Status: Published
Access rights to Published version: Restricted or Subscription Access
Funder: University of Warwick. Centre for Discrete Mathematics and its Applications (DIMAP), Universitetet i Linköping. Center for Industrial Information Technology (CENIIT), Sweden. Vetenskapsrådet [Swedish Research Council], Engineering and Physical Sciences Research Council (EPSRC)
Grant number: 04.01 (CENIIT), 621-2003-3421 (SRC), 2006-4532 (SRC), EP/C543831/1 (EPSRC)

Data sourced from Thomson Reuters' Web of Knowledge

Request changes or add full text files to a record

Repository staff actions (login required)

View Item View Item
twitter

Email us: wrap@warwick.ac.uk
Contact Details
About Us