Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
32
click to vote
COCO
1997
Springer
favorite
Email
discuss
report
77
views
Algorithms
»
more
COCO 1997
»
Constraint Satisfaction: The Approximability of Minimization Problems
14 years 2 months ago
Download
people.csail.mit.edu
Sanjeev Khanna, Madhu Sudan, Luca Trevisan
Real-time Traffic
Algorithms
|
COCO 1997
|
claim paper
Related Content
»
Linear time approximation schemes for the GaleBerlekamp game and related minimization prob...
»
Ruling Out PolynomialTime Approximation Schemes for Hard Constraint Satisfaction Problems
»
Tensor decomposition and approximation schemes for constraint satisfaction problems
»
Approximability of the Maximum Solution Problem for Certain Families of Algebras
»
On bounded occurrence constraint satisfaction
»
STCSP Structured Temporal Constraint satisfaction Problems
»
Fast SDP Algorithms for Constraint Satisfaction Problems
»
An efficient consistency algorithm for the Temporal Constraint Satisfaction Problem
»
An Algebraic Approach to Constraint Satisfaction Problems
more »
Post Info
More Details (n/a)
Added
25 Aug 2010
Updated
25 Aug 2010
Type
Conference
Year
1997
Where
COCO
Authors
Sanjeev Khanna, Madhu Sudan, Luca Trevisan
Comments
(0)
Researcher Info
Algorithms Study Group
Computer Vision