A New Algorithm for the Robust Semi-random Independent Set Problem

In this paper, we study a general semi-random version of the planted independent set problem in a model initially proposed by Feige and Kilian, which has a large proportion of adversarial edges. We give a new deterministic algorithm that finds a list of independent sets, one of which, with high probability, is the planted one, provided that the planted set has size $k=\Omega(n^{2/3})$. This improves on Feige and Kilian's original randomized algorithm, which with high probability recovers an independent set of size at least $k$ when $k=\alpha n$ where $\alpha$ is a constant.

[1]  Uriel Feige,et al.  Randomized graph products, chromatic numbers, and Lovasz j-function , 1995, STOC '95.

[2]  Aravindan Vijayaraghavan,et al.  Constant factor approximation for balanced cut in the PIE model , 2014, STOC.

[3]  Richard M. Karp,et al.  Reducibility among combinatorial problems" in complexity of computer computations , 1972 .

[4]  Amin Coja-Oghlan.  Solving NP-hard semirandom graph problems in polynomial expected time , 2007, J. Algorithms.

[5]  Sanjoy Dasgupta,et al.  An elementary proof of a theorem of Johnson and Lindenstrauss , 2003, Random Struct. Algorithms.

[6]  Alexandra Kolla,et al.  How to Play Unique Games Against a Semi-random Adversary: Study of Semi-random Models of Unique Games , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[7]  Sanjeev Arora,et al.  New approximation guarantee for chromatic number , 2006, STOC '06.

[8]  Satish Rao,et al.  Geometry, flows, and graph-partitioning algorithms , 2008, Commun. ACM.

[9]  Joel H. Spencer,et al.  Coloring Random and Semi-Random k-Colorable Graphs , 1995, J. Algorithms.

[10]  U. Feige,et al.  Finding and certifying a large hidden clique in a semirandom graph , 2000 .

[11]  Subhash Khot,et al.  Grothendieck‐Type Inequalities in Combinatorial Optimization , 2011, ArXiv.

[12]  Aravindan Vijayaraghavan,et al.  Approximation algorithms for semi-random partitioning problems , 2012, STOC '12.

[13]  Pravesh Kothari,et al.  A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).

[14]  Gregory Valiant,et al.  Learning from untrusted data , 2016, STOC.

[15]  Satish Rao,et al.  Expander flows, geometric embeddings and graph partitioning , 2004, STOC '04.

[16]  Ludek Kucera,et al.  Expected Complexity of Graph Partitioning Problems , 1995, Discret. Appl. Math..

[17]  Aravindan Vijayaraghavan,et al.  Approximation Algorithms for Semi-random Graph Partitioning Problems , 2012, ArXiv.

[18]  Jacob Steinhardt.  Does robustness imply tractability? A lower bound for planted clique in the semi-random model , 2017, Electron. Colloquium Comput. Complex..

[19]  Amin Coja-Oghlan.  Coloring Semirandom Graphs Optimally , 2004, ICALP.

[20]  Jean-Louis Verger-Gaugry,et al.  Covering a Ball with Smaller Equal Balls in ℝn , 2005, Discret. Comput. Geom..

[21]  Noga Alon,et al.  Finding a large hidden clique in a random graph , 1998, SODA '98.

[22]  David Zuckerman,et al.  Electronic Colloquium on Computational Complexity, Report No. 100 (2005) Linear Degree Extractors and the Inapproximability of MAX CLIQUE and CHROMATIC NUMBER , 2005 .

[23]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[24]  Uriel Feige,et al.  Heuristics for Semirandom Graph Problems , 2001, J. Comput. Syst. Sci..

[25]  A. Grothendieck.  Résumé de la théorie métrique des produits tensoriels topologiques , 1996 .

[26]  David P. Williamson,et al.  The Design of Approximation Algorithms , 2011 .