使用分组独立支持求解识别码集问题
Solving the Identifying Code Set Problem with Grouped Independent Support
AI总结:
本文研究广义识别码集问题,通过引入分组独立支持(GIS)将其归约为 GIS 问题,提出多项式级编码的新求解方法,相比指数级增长的 ILP 方法在节点网络规模上提升约40倍,中位求解时间提升最高达520倍,且解基数增幅低于10%。
摘要:
网络科学中的一个重要问题是在节点中寻找传感器的最优放置,以唯一检测网络中的故障。这个问题可以被建模为由 Karpovsky 等人于 1998 年提出的识别码集(ICS)问题。ICS 问题旨在寻找集合 $S$ 的一个覆盖,使得覆盖中的元素为 $S$ 的每个元素定义唯一的签名,并使覆盖的基数最小化。在这项工作中,我们研究了一个广义识别码集(GICS)问题,其中必须为 $S$ 的每个基数至多为 $k$ 的子集(而不仅仅是 $S$ 的每个元素)找到唯一的签名。Chakraborty 等人于 2014 年引入了布尔公式的独立支持概念,通过识别一个变量子集来加速命题模型计数,这些变量的真值赋值唯一地定义了其他变量的真值赋值。在这项工作中,我们引入了独立支持的扩展版本,即分组独立支持(GIS),并展示了如何将 GICS 问题归约到 GIS 问题。然后,我们提出了一种基于寻找 GIS 的求解 GICS 新方法。我们表明,先前最先进的方法产生的整数线性规划(ILP)模型的大小随问题规模和 $k$ 呈指数增长,而我们的 GIS 编码仅随问题规模和 $k$ 呈多项式增长。虽然 ILP 方法可以求解最多 494 个节点的网络上的 GICS 问题,但基于 GIS 的方法可以处理多达 21363 个节点的网络;这是一个约 $40\ imes$ 的改进。在中位求解时间方面,基于 GIS 的方法比基于 ILP 的方法显示出高达 $520\ imes$ 的改进。对于两种方法都可以编码和求解的大多数实例,基于 GIS 的方法返回的解的基数比 ILP 方法找到的解的基数大不到 $10\%$。
英文摘要:
An important problem in network science is finding an optimal placement of sensors in nodes in order to uniquely detect failures in the network. This problem can be modelled as an identifying code set (ICS) problem, introduced by Karpovsky et al. in 1998. The ICS problem aims to find a cover of a set $S$, s.t. the elements in the cover define a unique signature for each of the elements of $S$, and to minimise the cover's cardinality. In this work, we study a generalised identifying code set (GICS) problem, where a unique signature must be found for each subset of $S$ that has a cardinality of at most $k$ (instead of just each element of $S$). The concept of an independent support of a Boolean formula was introduced by Chakraborty et al. in 2014 to speed up propositional model counting, by identifying a subset of variables whose truth assignments uniquely define those of the other variables. In this work, we introduce an extended version of independent support, grouped independent support (GIS), and show how to reduce the GICS problem to the GIS problem. We then propose a new solving method for finding a GICS, based on finding a GIS. We show that the prior state-of-the-art approaches yield integer-linear programming (ILP) models whose sizes grow exponentially with the problem size and $k$, while our GIS encoding only grows polynomially with the problem size and $k$. While the ILP approach can solve the GICS problem on networks of at most 494 nodes, the GIS-based method can handle networks of up to 21363 nodes; a $\sim 40\times$ improvement. The GIS-based method shows up to a $520\times$ improvement on the ILP-based method in terms of median solving time. For the majority of the instances that can be encoded and solved by both methods, the cardinality of the solution returned by the GIS-based method is less than $10\%$ larger than the cardinality of the solution found by the ILP method.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。