In this paper, the tile assembly model can be applied to solve the set cover problem which is a well-known NP-complete problem. In order to achieve this, we design a MinSetCover system which is composed of three parts, the initial configuration subsystem, the nondeterministic choosing ...
The SCP is an NP-hard combinatorial optimisation problem. In the case of the Minimum SCP, there exists a polynomial-time approximation algorithm that is guaranteed to return a solution that is worse than the minimum number of sets required to cover A by a factor of at most 1 + logm[Johnso...
because a reasonable solution has been determined which cannot be improved on in a reasonable time (note that the set covering problem is NP-complete (Karp, 1972); because the cost to be divided is the maintenance cost; or because the interested parties have reached an agreement on the final...
The unweighted k-set cover prob- lem is known to be NP-complete [13] and MAX SNP-hard for all k ≥ 3 [3, 14, 16]. Another algorithm for the weighted set cover problem by Hochbaum [10] has an approximation ratio that depends on the maximum number of subsets that contain any given...
Here we consider using quantum annealing to solve Set Cover with Pairs (SCP), an NP-hard combinatorial optimization problem that plays an important role in networking, computational biology and biochemistry. We show an explicit construction of Ising Hami
首先,HITTING SET是一个NP问题。 对于H中的所有元素,和Si逐个比较是否有交集并且大小小于等于b,这个操作显然是多项式时间复杂度的问题。 其次,Vertex Cover是一个NP难问题。 由书本P241、242,可知最小顶点覆盖问题(Vertex Cover)是NP难问题。 最后,将Vertex Cover归约到HITTING SET,即可证明碰撞集问题是一个NP完全...
摘要: Starting from the vertex cover problem, this paper obtains a more particular NP-complete problem (comparing with the feedback vertex set problem) and its counterpart in finite automata theory关键词: Theoretical or Mathematical/ finite automata set theory/ vertex cover NP-complete feedback ...
thesetcoverproblemandtheproblemofexactcoverby3-sets. ©2003ElsevierIrelandLtd.Allrightsreserved. Keywords:Biologicalcomputing;Molecularcomputing;DNA-basedcomputing;TheNP-completeproblem 1.Introduction Producing10 18 DNAstrandsthatfitinatesttube ispossiblethroughadvancesinmolecularbiology (Sinden,1994).Adlemanwro...
SetCover问题是组合优化领域中的一个基本问题,Karp 在其著名的论文 [1] 中列出了21个NP完全问题,SetCover问 题便是其一。该问题被广泛应用于大规模集成电路设备的测 试和人员调度等领域。对SetCover问题的贪心算法加以推 广,可求解生物信息学中出现的冗余测试集问题。同时,Set ...
(MPR). For example, MPR nodes collect local link status information and advertise this information via efficient packet flooding. However, the identification of a subset of MPRs capable of reaching every node of the network is an NP-complete set-cover problem which cannot be optimized without ...