Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

66

APPROX
2006
Springer

favoriteEmaildiscussreport

79views Algorithms» more APPROX 2006»

On Nontrivial Approximation of CSPs

15 years 1 months ago

On Nontrivial Approximation of CSPs

Download www.nada.kth.se

Johan Håstad

Real-time Traffic

Algorithms | APPROX 2006 |

claim paper

Related Content

» Every 2CSP allows nontrivial approximation

» Experimental Evaluation of Interchangeability in Soft CSPs

» On the Computation of Local Interchangeability in Soft Constraint Satisfaction Problems

» Learning Approximate Consistencies

» Experimental study of hybridtype distributed maximal constraint satisfaction algorithm

» On Quadratic Threshold CSPs

» Approximating Steiner Networks with NodeWeights

» Optimal Inapproximability Results for MaxCut and Other 2Variable CSPs

» Bayes Networks for Estimating the Number of Solutions to a CSP

Post Info
More Details (n/a)

Added	20 Aug 2010
Updated	20 Aug 2010
Type	Conference
Year	2006
Where	APPROX
Authors	Johan Håstad

Comments (0)