DeepAI AI Chat
Log In Sign Up

On NP-completeness of the cell formation problem

by   Mikhail V. Batsyn, et al.
Higher School of Economics

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.


page 1

page 2

page 3

page 4


Shellings from relative shellings, with an application to NP-completeness

Shellings of simplicial complexes have long been a useful tool in topolo...

MaxCut on Permutation Graphs is NP-complete

In this paper, we prove that the MaxCut problem is NP-complete on permut...

The n-vehicle exploration problem is NP-complete

The n-vehicle exploration problem (NVEP) is a combinatorial optimization...

Recognizing DAGs with Page-Number 2 is NP-complete

The page-number of a directed acyclic graph (a DAG, for short) is the mi...

Decompositions into two linear forests of bounded lengths

For some k ∈ℤ_≥ 0∪∞, we call a linear forest k-bounded if each of its co...

NP-completeness of slope-constrained drawing of complete graphs

We prove the NP-completeness of the following problem. Given a set S of ...

NP Decision Procedure for Monomial and Linear Integer Constraints

Motivated by satisfiability of constraints with function symbols, we con...