半随机超图中的独立集
Independent Sets in Semi-random Hypergraphs
摘要:
超图的顶点集称为独立集,如果没有一个超边完全包含在这个顶点集中。给定一个超图,求其最大独立集是一个NP难问题。本文研究了自然半随机实例族中超图的独立集问题。我们的半随机模型受到Feige-Kilian模型[FK 01]的启发。这种流行的模型也被研究的作品[FK 01,Ste 17,MMT 20]等麦肯齐,梅塔,和Trevisan [MMT 20]给出了算法计算独立集在这样一个半随机族的图。McKenzie等人[MMT 20]的算法基于舍入“粗SDP”。我们推广他们的结果和技术,超图的一个类似的家庭超图的实例。我们的算法是基于四舍五入的McKenzie等人的“粗SDP”。[MMT 20],增加了“Lasserre/SoS样”层次结构的约束。类似于McKenzie等人的结果。[MMT 20],我们研究了可以恢复种植的独立集或大的独立集的输入参数范围。
英文摘要:
A set of vertices in a hypergraph is called an independent set if no hyperedge is completely contained inside the set. Given a hypergraph, computing its largest size independent set is an NP-hard problem. In this work, we study the independent set problem on hypergraphs in a natural semi-random family of instances. Our semi-random model is inspired by the Feige-Kilian model [FK01]. This popular model has also been studied in the works of [FK01, Ste17, MMT20] etc. McKenzie, Mehta, and Trevisan [MMT20] gave algorithms for computing independent sets in such a semi-random family of graphs. The algorithms by McKenzie et al. [MMT20] are based on rounding a "crude-SDP". We generalize their results and techniques to hypergraphs for an analogous family of hypergraph instances. Our algorithms are based on rounding the "crude-SDP" of McKenzie et al. [MMT20], augmented with "Lasserre/SoS like" hierarchy of constraints. Analogous to the results of McKenzie et al. [MMT20], we study the ranges of input parameters where we can recover the planted independent set or a large independent set.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。