Document Open Access Logo

Approximation Algorithms for CSPs

Authors Konstantin Makarychev, Yury Makarychev



PDF
Thumbnail PDF

File

DFU.Vol7.15301.287.pdf
  • Filesize: 0.71 MB
  • 39 pages

Document Identifiers

Author Details

Konstantin Makarychev
Yury Makarychev

Cite AsGet BibTex

Konstantin Makarychev and Yury Makarychev. Approximation Algorithms for CSPs. In The Constraint Satisfaction Problem: Complexity and Approximability. Dagstuhl Follow-Ups, Volume 7, pp. 287-325, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
https://doi.org/10.4230/DFU.Vol7.15301.287

Abstract

In this survey, we offer an overview of approximation algorithms for constraint satisfaction problems (CSPs) - we describe main results and discuss various techniques used for solving CSPs.
Keywords
  • Constraint satisfaction problems
  • Approximation algorithms
  • SDP
  • UGC

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail