Beating a Random Assignment : Approximating Constraint Satisfaction Problems

Gustav Hast. Beating a Random Assignment : Approximating Constraint Satisfaction Problems. PhD thesis, Royal Institute of Technology, Stockholm, Sweden, 2005. [doi]

Abstract

Abstract is missing.