Solving the K-Cluster Optimization Problems in Combinatorial Optimization

Abstract

The optimization problem is demonstrated to be an NP-Hardness problem in this research using a sound methodology. First off, one of the most significant NP-hardness issues in combinatorial optimization is the K-cluster problem. Second, an issue is considered difficult if it cannot be resolved specifically (i.e., in polynomial time) by a workable algorithm. Additionally, the approach taken in this paper is to use a method to demonstrate that the problem is NP-Hard. If any problem from NP can be reduced to it, as shown by means reductions, then the problem is NP-Hard.