Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH scholarly article en Makarychev, Konstantin; Makarychev, Yury http://www.dagstuhl.de/dfu License
when quoting this document, please refer to the following
DOI:
URN: urn:nbn:de:0030-drops-69685
URL:

;

Approximation Algorithms for CSPs

pdf-format:


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.

BibTeX - Entry

@InCollection{makarychev_et_al:DFU:2017:6968,
  author =	{Konstantin Makarychev and Yury Makarychev},
  title =	{{Approximation Algorithms for CSPs}},
  booktitle =	{The Constraint Satisfaction Problem: Complexity and Approximability},
  pages =	{287--325},
  series =	{Dagstuhl Follow-Ups},
  ISBN =	{978-3-95977-003-3},
  ISSN =	{1868-8977},
  year =	{2017},
  volume =	{7},
  editor =	{Andrei Krokhin and Stanislav Zivny},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2017/6968},
  URN =		{urn:nbn:de:0030-drops-69685},
  doi =		{10.4230/DFU.Vol7.15301.287},
  annote =	{Keywords: Constraint satisfaction problems, Approximation algorithms, SDP, UGC}
}

Keywords: Constraint satisfaction problems, Approximation algorithms, SDP, UGC
Seminar: The Constraint Satisfaction Problem: Complexity and Approximability
Issue date: 2017
Date of publication: 2017


DROPS-Home | Fulltext Search | Imprint Published by LZI