Sciweavers

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

32

IPL
2000

favoriteEmaildiscussreport

96views more IPL 2000»

On bounded occurrence constraint satisfaction

13 years 11 months ago

On bounded occurrence constraint satisfaction

Download www.ti.inf.ethz.ch

An approximation algorithm for a constraint satisfaction problem is said to be nontrivial if its performance ratio is strictly superior to the expected performance of the algorithm which simply chooses a random assignment. We prove that any constraint satisfaction problem where each variable appears a bounded number of times admits a nontrivial polynomial time approximation algorithm.

Johan Håstad

Real-time Traffic

Approximation Algorithm | Constraint Satisfaction Problem | IPL 2000 | Nontrivial Polynomial Time |

claim paper

Related Content

» Parameterized Complexity of Constraint Satisfaction Problems

» Ruling Out PolynomialTime Approximation Schemes for Hard Constraint Satisfaction Problems

» Hard constraint satisfaction problems have hard gaps at location 1

» Constraint satisfaction a personal perspective

» The approximability of MAX CSP with fixedvalue constraints

» Typical random 3SAT formulae and the satisfiability threshold

» Majority constraints have bounded pathwidth duality

» The Exact Closest String Problem as a Constraint Satisfaction Problem

» CSP duality and trees of bounded pathwidth

Post Info
More Details (n/a)

Added	18 Dec 2010
Updated	18 Dec 2010
Type	Journal
Year	2000
Where	IPL
Authors	Johan Håstad

Comments (0)