Results 1  10
of
524
Complexity and Approximability for Parameterized
"... The complexity of various Constraint Satisfaction Problems (CSP) when parameterized by structural measures (such as treewidth or cliquewidth) is a very wellinvestigated area. In this paper, we take a fresh look at such questions from the point of view of approximation, considering four standard CS ..."
Abstract
 Add to MetaCart
The complexity of various Constraint Satisfaction Problems (CSP) when parameterized by structural measures (such as treewidth or cliquewidth) is a very wellinvestigated area. In this paper, we take a fresh look at such questions from the point of view of approximation, considering four standard
Adaptive Parameterized Consistency for NonBinary CSPs by Counting Supports?
"... Abstract. Determining the appropriate level of local consistency to enforce on a given instance of a Constraint Satisfaction Problem (CSP) is not an easy task. However, selecting the right level may determine our ability to solve the problem. Adaptive parameterized consistency was recently propose ..."
Abstract
 Add to MetaCart
cently proposed for binary CSPs as a strategy to dynamically select one of two local consistencies (i.e., AC and maxRPC). In this paper, we propose a similar strategy for nonbinary table constraints to select between enforcing GAC and pairwise consistency. While the former strategy approximates the supports
The complexity of approximating boundeddegree boolean #CSP
 STACS, VOLUME 5 OF LIPICS
, 2010
"... The degree of a CSP instance is the maximum number of times that a variable may appear in the scope of constraints. We consider the approximate counting problem for Boolean CSPs with boundeddegree instances, for constraint languages containing the two unary constant relations {0} and {1}. When the ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
The degree of a CSP instance is the maximum number of times that a variable may appear in the scope of constraints. We consider the approximate counting problem for Boolean CSPs with boundeddegree instances, for constraint languages containing the two unary constant relations {0} and {1}. When
Approximation Schemes for . . .
, 2011
"... In correlation clustering, given similarity or dissimilarity information for all pairs of data items, the goal is to find a clustering of the items into similarity classes, with the fewest inconsistencies with the input. This problem is hard to approximate in general but we give arbitrarily good app ..."
Abstract
 Add to MetaCart
In correlation clustering, given similarity or dissimilarity information for all pairs of data items, the goal is to find a clustering of the items into similarity classes, with the fewest inconsistencies with the input. This problem is hard to approximate in general but we give arbitrarily good
Approximating Linear Threshold Predicates
"... We study constraint satisfaction problems on the domain {−1, 1}, where the given constraints are homogeneous linear threshold predicates. That is, predicates of the form sgn(w1x1 + · · · + wnxn) for some positive integer weights w1,..., wn. Despite their simplicity, current techniques fall short ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
short of providing a classification of these predicates in terms of approximability. In fact, it is not easy to guess whether there exists a homogeneous linear threshold predicate that is approximation resistant or not. The focus of this paper is to identify and study the approximation curve of a class
CS880: Approximations Algorithms
"... Today we discuss the background and motivation behind studying approximation algorithms and give a few examples of approximations for classic problems. Approximation algorithms make up a broad topic and are applicable to many areas. In this course a variety of different techniques for crafting appro ..."
Abstract
 Add to MetaCart
Today we discuss the background and motivation behind studying approximation algorithms and give a few examples of approximations for classic problems. Approximation algorithms make up a broad topic and are applicable to many areas. In this course a variety of different techniques for crafting
 [Ajt02].approximation
, 2013
"... Version 2.05 Title word crossreference #SAT [BDP03]. (1 + ) [KSS04]. (2 + ) [Ber09]. ..."
Abstract
 Add to MetaCart
Version 2.05 Title word crossreference #SAT [BDP03]. (1 + ) [KSS04]. (2 + ) [Ber09].
The NonApproximability of NonBoolean Predicates
 Trevisan (Eds.), Proceedings of 5th International Workshop on Randomization and Approximation Techniques in Computer Science
, 2001
"... Constraint satisfaction programs where each constraint depends on a constant number of variables have the following property: The randomized algorithm that guesses an assignment uniformly at random satisfies an expected constant fraction of the constraints. By combining constructions from interactiv ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
Constraint satisfaction programs where each constraint depends on a constant number of variables have the following property: The randomized algorithm that guesses an assignment uniformly at random satisfies an expected constant fraction of the constraints. By combining constructions from interactive proof systems with harmonic analysis over finite groups, Hstad showed that for several constraint satisfaction programs this naive algorithm is essentially the best possible unless P = NP.
Approximation of Local Consistency for Soft Constraints
"... In this paper we generalize to soft constraints the techniques and approximations usually used for local consistency in classical constraint satisfaction and programming. The theoretical results show that this is indeed possible without loosing the fundamental properties of such techniques, and the ..."
Abstract
 Add to MetaCart
In this paper we generalize to soft constraints the techniques and approximations usually used for local consistency in classical constraint satisfaction and programming. The theoretical results show that this is indeed possible without loosing the fundamental properties of such techniques
The Approximability of Learning and Constraint Satisfaction Problems
, 2010
"... International Business Machine. The views and conclusions contained in this document are those of the ..."
Abstract
 Add to MetaCart
International Business Machine. The views and conclusions contained in this document are those of the
Results 1  10
of
524