License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.APPROX-RANDOM.2016.20
URN: urn:nbn:de:0030-drops-66437
URL: http://drops.dagstuhl.de/opus/volltexte/2016/6643/
Go to the corresponding LIPIcs Volume Portal


Syed, Ridwan ; Tulsiani, Madhur

Proving Weak Approximability Without Algorithms

pdf-format:
LIPIcs-APPROX-RANDOM-2016-20.pdf (0.5 MB)


Abstract

A boolean predicate is said to be strongly approximation resistant if, given a near-satisfiable instance of its maximum constraint satisfaction problem, it is hard to find an assignment such that the fraction of constraints satisfied deviates significantly from the expected fraction of constraints satisfied by a random assignment. A predicate which is not strongly approximation resistant is known as weakly approximable. We give a new method for proving the weak approximability of predicates, using a simple SDP relaxation, without designing and analyzing new rounding algorithms for each predicate. Instead, we use the recent characterization of strong approximation resistance by Khot et al. [STOC 2014], and show how to prove that for a given predicate, certain necessary conditions for strong resistance derived from their characterization, are violated. By their result, this implies the existence of a good rounding algorithm, proving weak approximability. We show how this method can be used to obtain simple proofs of (weak approximability analogues of) various known results on approximability, as well as new results on weak approximability of symmetric predicates.

BibTeX - Entry

@InProceedings{syed_et_al:LIPIcs:2016:6643,
  author =	{Ridwan Syed and Madhur Tulsiani},
  title =	{{Proving Weak Approximability Without Algorithms}},
  booktitle =	{Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)},
  pages =	{20:1--20:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-018-7},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{60},
  editor =	{Klaus Jansen and Claire Mathieu and Jos{\'e} D. P. Rolim and Chris Umans},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2016/6643},
  URN =		{urn:nbn:de:0030-drops-66437},
  doi =		{10.4230/LIPIcs.APPROX-RANDOM.2016.20},
  annote =	{Keywords: approximability, constraint satisfaction problems, approximation resistance, linear programming, semidefinite programming}
}

Keywords: approximability, constraint satisfaction problems, approximation resistance, linear programming, semidefinite programming
Seminar: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)
Issue Date: 2016
Date of publication: 06.09.2016


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