1. NP-completeness of cell formation problem with grouping efficacy objective.
- Author
-
Batsyn, Mikhail V., Batsyna, Ekaterina K., and Bychkov, Ilya S.
- Subjects
NP-complete problems ,GROUP formation ,CELLS ,POLYNOMIALS ,COMPLETENESS theorem ,CARBON dioxide lasers - Abstract
In the current paper we provide a proof of NP-completeness for the Cell Formation Problem (CFP) with the fractional grouping efficacy objective function. First the CFP with a linear objective function is considered. 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 due to the reduction from the 3-Exact 3-Cover Problem – 3E3CP (Amit, 2004). Then we suggest a polynomial reduction of the CFP with the linear objective to the CFP with the grouping efficacy objective. It proves the NP-completeness of this fractional CFP formulation. Along with the NP-status our paper presents important connections of the CFP with the BGEP and 3E3CP. Such connections could be used for "transferring" of known theoretical properties, efficient algorithms, polynomial cases, and other features of well-studied graph editing and exact covering problems to the CFP. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF