Every 2-CSP allows nontrivial approximation Johan H˚ astad Royal Institute of Technology - Combinatorial optimization - Document - PDFSEARCH.IO

First Page	Meta Content
	Every 2-CSP allows nontrivial approximation Johan H˚ astad Royal Institute of Technology Add to Reading List Document Date: 2005-06-22 08:43:27 Open Document File Size: 109,77 KB Share Result on Facebook Facility Royal Institute of Technology Stockholm / / IndustryTerm random algorithm / take best solution / Eﬃcient algorithms / / Organization Institute of Technology Stockholm / / Technology Eﬃcient algorithms / eﬃcient C-approximation algorithm / / SocialTag Constraint programming Computational complexity theory Constraint satisfaction problem 2-satisfiability Constraint satisfaction Approximation algorithm Logic in computer science Combinatorial optimization Linear programming Theoretical computer science

Every 2-CSP allows nontrivial approximation Johan H˚ astad Royal Institute of TechnologyAdd to Reading List