License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2019.17
URN: urn:nbn:de:0030-drops-102564
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2019/10256/
Go to the corresponding LIPIcs Volume Portal

Butti, Silvia ; Zivný, Stanislav

Sparsification of Binary CSPs

pdf-format:
LIPIcs-STACS-2019-17.pdf (0.4 MB)

Abstract

A cut epsilon-sparsifier of a weighted graph G is a re-weighted subgraph of G of (quasi)linear size that preserves the size of all cuts up to a multiplicative factor of epsilon. Since their introduction by Benczúr and Karger [STOC'96], cut sparsifiers have proved extremely influential and found various applications. Going beyond cut sparsifiers, Filtser and Krauthgamer [SIDMA'17] gave a precise classification of which binary Boolean CSPs are sparsifiable. In this paper, we extend their result to binary CSPs on arbitrary finite domains.

BibTeX - Entry

@InProceedings{butti_et_al:LIPIcs:2019:10256,
  author =	{Silvia Butti and Stanislav Zivn{\'y}},
  title =	{{Sparsification of Binary CSPs}},
  booktitle =	{36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)},
  pages =	{17:1--17:8},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-100-9},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{126},
  editor =	{Rolf Niedermeier and Christophe Paul},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2019/10256},
  doi =		{10.4230/LIPIcs.STACS.2019.17},
  annote =	{Keywords: constraint satisfaction problems, minimum cuts, sparsification}
}

Keywords: constraint satisfaction problems, minimum cuts, sparsification
Collection: 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)
Issue Date: 2019
Date of publication: 12.03.2019

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI