In this paper, we study the Planted Clique problem in a semi-random model. Our model is inspired from the Feige-Kilian model [16] which has been studied in many other works [8,11,17,26,35,38] for a variety of graph problems. Our algorithm and analysis is on similar lines to the one studied for the Densest $k$-subgraph problem in the work of Khanna and Louis [25]. As a by-product of our main result, we give an alternate SDP-based rounding algorithm (with similar guarantees) for solving the Planted Clique problem in a random graph.

翻译：本文研究了半随机模型下的植入团问题。我们的模型受Feige-Kilian模型[16]启发，该模型已在众多其他研究[8,11,17,26,35,38]中被用于多种图问题分析。我们的算法与证明思路与Khanna和Louis[25]工作中针对最密k-子图问题的方法类似。作为主要结果的副产品，我们提出了一种基于半正定规划的替代舍入算法（具有相近的保证性能），用于解决随机图中的植入团问题。