arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1901.02778cs.CC
收藏

关于胞元形成问题的NP完全性

On NP-completeness of the cell formation problem

Mikhail V. Batsyn, Ekaterina K. Batsyna, Ilya S. Bychkov

摘要:

在本文中,我们提供了一个证明的NP完全性的CFP问题的分数分组功效目标。为此,我们首先考虑CFP的线性目标最小化的例外和空隙的总数。遵循Pinheiro等人的想法。(2016)我们证明了它等价于Bicluster Graph Editing Problem(BGEP),BGEP是NP完全的(Amit,2004)。然后,我们建议减少CFP问题的线性目标函数的CFP与分组功效目标。

英文摘要:

In the current paper we provide a proof of NP-completeness for the CFP problem with the fractional grouping efficacy objective. For this purpose we first consider the CFP with the linear objective minimizing the total number of exceptions and voids. Following the ideas of Pinheiro et al. (2016) we show that it is equivalent to the Bicluster Graph Editing Problem (BGEP), which is known to be NP-complete (Amit, 2004). Then we suggest a reduction of the CFP problem with the linear objective function to the CFP with the grouping efficacy objective.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑