Sciweavers

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

18

APPROX
2008
Springer

favoriteEmaildiscussreport

128views Algorithms» more APPROX 2008»

Constraint Satisfaction over a Non-Boolean Domain: Approximation Algorithms and Unique-Games Hardness

13 years 6 months ago

Constraint Satisfaction over a Non-Boolean Domain: Approximation Algorithms and Unique-Games Hardness

Download www.cs.cmu.edu

Venkatesan Guruswami, Prasad Raghavendra

Real-time Traffic

Algorithms | APPROX 2008 |

claim paper

Related Content

» Nearoptimal algorithms for unique games

» Universal Algebra and Hardness Results for Constraint Satisfaction Problems

» Optimal SheraliAdams Gaps from Pairwise Independence

» Beating the Random Ordering is Hard Inapproximability of Maximum Acyclic Subgraph

» Optimal Inapproximability Results for MaxCut and Other 2Variable CSPs

» On Quadratic Programming with a Ratio Objective

» Polynomial integrality gaps for strong SDP relaxations of Densest ksubgraph

» From query complexity to computational complexity

» New LookAhead Schemes for Constraint Satisfaction

Post Info
More Details (n/a)

Added	18 Oct 2010
Updated	18 Oct 2010
Type	Conference
Year	2008
Where	APPROX
Authors	Venkatesan Guruswami, Prasad Raghavendra

Comments (0)