New NP-complete partition problemsProposes several problems in partitions. Definitions of the partition problems; Discussion on the proofs of completeness for the problems; Discussion on a problem in syndrome decoding.SaeedniaShahrokhIEEE Transactions on Information Theory...
"Intuitively, this sounds like an NP-complete problem (it reduces to a problem very like bin packing), however the following algorithm (a modified form of bin packing) should be pretty good (no time for a proof, sorry). Net out everyone's positions, i.e. from your example above: Alice...
frances.rosamond@newcastle.edu.auAbstractTheproblemofdecidingwhethertheedge-setofagivengraphcanbepartitionedintoatmostkcliquesiswellknowntobeNP-complete.Inthispaperweinvestigatethisproblemfromthepointofviewofpa-rameterizedcomplexity.Weshowthatthisproblemisfixedparametertractableifwechoosethenumberofcliquesas...
The problem is NP-complete, so that we cannot expect a polynomial time algorithm for solving it. Theorem 13.6 (Complexity Number Partition) Number Partition is NP-hard. Proof Number Partition can be reduced from the following (specialized) knapsack problem: Given a=(a1,…,an) and an integer...
Although it is polynomial to determine whether a graph is unipolar and to find whenever possible a unipolar partition, the problems of recognizing polar and monopolar graphs are both NP-complete in general. These problems have recently been studied for chordal, claw-free, and permutation graphs. ...
Clearly, these two problems are in NP. We prove that BALANCED SATISFACTORY PARTITION is NP-complete, which implies by Proposition 11 that SATISFACTORY PARTITION is NP-complete too. We construct a polynomial reduction from a variant of CLIQUE, the problem of deciding if a noncomplete graph with ...
关键词: Membrane computing P system Membrane division Uniform solution NP-complete problem DOI: 10.1007/978-3-662-45049-9_33 被引量: 1 年份: 2014 收藏 引用 批量引用 报错 分享 全部来源 求助全文 Springer dx.doi.org Ingenta ResearchGate zentralblatt-math.org 相似文献 参考文献 引证文献...
Given a set of elements N with k partitions of N, the k partition-distance problem is to delete the minimum number of elements from each partition such that all remaining partitions become identical. This problem is NP-complete for general k>2 partitions, and no algorithms are known at ...
Although the problem of choosing transactions to minimize total backout cost is, in general, NP-complete, the backout strategy is efficient and produces very good results. 展开 DOI: 10.1145/1270.1499 被引量: 270 年份: 1984 收藏 引用 批量引用 报错 分享 ...
It is shown that the group identification problem is NP-complete. Replica control algorithms that attempt to approximately determine groups are presented. In one algorithm, groups are determined dynamically; in the other techniques, groups are predefined. It is shown formally that both approaches ...